Complexity of triangular representations of algebraic sets

Eli Amzallag; Mengxiao Sun; Gleb Pogudin; Thieu N. Vo

doi:10.1016/j.jalgebra.2019.01.007

Complexity of triangular representations of algebraic sets

Eli Amzallag
, Mengxiao Sun
, Gleb Pogudin
, Thieu N. Vo

The City College of New York
The Graduate Center
Johannes Kepler University Linz
Ton Duc Thang University

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

1 Citation (Scopus)

Résumé

Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szántó. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit formulas for these bounds.

langue originale	Anglais
Pages (de - à)	342-364
Nombre de pages	23
journal	Journal of Algebra
Volume	523
Les DOIs	https://doi.org/10.1016/j.jalgebra.2019.01.007
état	Publié - 1 avr. 2019
Modification externe	Oui

Accès au document

10.1016/j.jalgebra.2019.01.007

Contient cette citation

@article{f7afaad81e494e309d08bd81e701eae7,

title = "Complexity of triangular representations of algebraic sets",

abstract = "Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Sz{\'a}nt{\'o}. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit formulas for these bounds.",

author = "Eli Amzallag and Mengxiao Sun and Gleb Pogudin and Vo, \{Thieu N.\}",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",

year = "2019",

month = apr,

day = "1",

doi = "10.1016/j.jalgebra.2019.01.007",

language = "English",

volume = "523",

pages = "342--364",

journal = "Journal of Algebra",

issn = "0021-8693",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Complexity of triangular representations of algebraic sets

AU - Amzallag, Eli

AU - Sun, Mengxiao

AU - Pogudin, Gleb

AU - Vo, Thieu N.

PY - 2019/4/1

Y1 - 2019/4/1

N2 - Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szántó. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit formulas for these bounds.

AB - Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szántó. In this paper, we give the first complete bounds for the degrees of the polynomials and the number of components in the output of the algorithm, providing explicit formulas for these bounds.

U2 - 10.1016/j.jalgebra.2019.01.007

DO - 10.1016/j.jalgebra.2019.01.007

M3 - Article

AN - SCOPUS:85060341128

SN - 0021-8693

VL - 523

SP - 342

EP - 364

JO - Journal of Algebra

JF - Journal of Algebra

ER -

Complexity of triangular representations of algebraic sets

Résumé

Accès au document

Empreinte digitale

Contient cette citation