Publikation: Computing images of polynomial maps
Lade...
Dateien
Datum
2019
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Hybrid
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen 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-8
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Polynomial maps, Constructible set, Matrix product states
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
HARRIS, 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-8BibTex
@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}
}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>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Ja
