Computing images of polynomial maps

Kurzanzeige
dc.contributor.authorHarris, Corey
dc.contributor.authorMichalek, Mateusz
dc.contributor.authorSertöz, Emre Can
dc.date.accessioned2021-01-15T12:14:48Z
dc.date.available2021-01-15T12:14:48Z
dc.date.issued2019-12eng
dc.description.abstractThe image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric techniques, addressing this problem. We also apply these methods to answer a question of W. Hackbusch on the non-closedness of site-independent cyclic matrix product states for infinitely many parameters.eng
dc.description.versionpublishedeng
dc.identifier.doi10.1007/s10444-019-09715-8eng
dc.identifier.ppn1744761183
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/52467
dc.language.isoengeng
dc.rightsAttribution 4.0 International
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.subjectPolynomial maps, Constructible set, Matrix product stateseng
dc.subject.ddc510eng
dc.titleComputing images of polynomial mapseng
dc.typeJOURNAL_ARTICLEeng
dspace.entity.typePublication
kops.citation.bibtex
@article{Harris2019-12Compu-52467,
  year={2019},
  doi={10.1007/s10444-019-09715-8},
  title={Computing images of polynomial maps},
  number={5-6},
  volume={45},
  issn={1019-7168},
  journal={Advances in Computational Mathematics},
  pages={2845--2865},
  author={Harris, Corey and Michalek, Mateusz and Sertöz, Emre Can}
}
kops.citation.iso690HARRIS, Corey, Mateusz MICHALEK, Emre Can SERTÖZ, 2019. Computing images of polynomial maps. In: Advances in Computational Mathematics. Springer. 2019, 45(5-6), pp. 2845-2865. ISSN 1019-7168. eISSN 1572-9044. Available under: doi: 10.1007/s10444-019-09715-8deu
kops.citation.iso690HARRIS, Corey, Mateusz MICHALEK, Emre Can SERTÖZ, 2019. Computing images of polynomial maps. In: Advances in Computational Mathematics. Springer. 2019, 45(5-6), pp. 2845-2865. ISSN 1019-7168. eISSN 1572-9044. Available under: doi: 10.1007/s10444-019-09715-8eng
kops.citation.rdf
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/52467">
    <dc:contributor>Harris, Corey</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/52467"/>
    <dc:creator>Harris, Corey</dc:creator>
    <dc:creator>Michalek, Mateusz</dc:creator>
    <dc:contributor>Michalek, Mateusz</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:creator>Sertöz, Emre Can</dc:creator>
    <dcterms:abstract xml:lang="eng">The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric techniques, addressing this problem. We also apply these methods to answer a question of W. Hackbusch on the non-closedness of site-independent cyclic matrix product states for infinitely many parameters.</dcterms:abstract>
    <dc:rights>Attribution 4.0 International</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/52467/1/Harris_2-1whkbv4xfo1mk9.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-01-15T12:14:48Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dcterms:title>Computing images of polynomial maps</dcterms:title>
    <dc:contributor>Sertöz, Emre Can</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-01-15T12:14:48Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/52467/1/Harris_2-1whkbv4xfo1mk9.pdf"/>
    <dcterms:issued>2019-12</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccesshybrideng
kops.flag.isPeerReviewedtrueeng
kops.flag.knbibliographyfalse
kops.identifier.nbnurn:nbn:de:bsz:352-2-1whkbv4xfo1mk9
kops.sourcefieldAdvances in Computational Mathematics. Springer. 2019, <b>45</b>(5-6), pp. 2845-2865. ISSN 1019-7168. eISSN 1572-9044. Available under: doi: 10.1007/s10444-019-09715-8deu
kops.sourcefield.plainAdvances in Computational Mathematics. Springer. 2019, 45(5-6), pp. 2845-2865. ISSN 1019-7168. eISSN 1572-9044. Available under: doi: 10.1007/s10444-019-09715-8deu
kops.sourcefield.plainAdvances in Computational Mathematics. Springer. 2019, 45(5-6), pp. 2845-2865. ISSN 1019-7168. eISSN 1572-9044. Available under: doi: 10.1007/s10444-019-09715-8eng
relation.isAuthorOfPublication69125c6a-217b-4038-b44c-86d149487b80
relation.isAuthorOfPublication.latestForDiscovery69125c6a-217b-4038-b44c-86d149487b80
source.bibliographicInfo.fromPage2845eng
source.bibliographicInfo.issue5-6eng
source.bibliographicInfo.toPage2865eng
source.bibliographicInfo.volume45eng
source.identifier.eissn1572-9044eng
source.identifier.issn1019-7168eng
source.periodicalTitleAdvances in Computational Mathematicseng
source.publisherSpringereng

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Harris_2-1whkbv4xfo1mk9.pdf
Größe:
1.22 MB
Format:
Adobe Portable Document Format
Beschreibung:
Harris_2-1whkbv4xfo1mk9.pdf
Harris_2-1whkbv4xfo1mk9.pdfGröße: 1.22 MBDownloads: 645

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
3.96 KB
Format:
Item-specific license agreed upon to submission
Beschreibung:
license.txt
license.txtGröße: 3.96 KBDownloads: 0

Sammlungen

Mathematik und Statistik: Publikationen