A Direttissimo Algorithm for Equidimensional Decomposition - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

A Direttissimo Algorithm for Equidimensional Decomposition

Christian Eder
  • Function : Author
  • PersonId : 954916
Rafael Mohr
  • Function : Author
  • PersonId : 1128325
Mohab Safey El Din


We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the theory of triangular sets, a.k.a. regular chains, with Gröbner bases to encode and work with locally closed algebraic sets. Equipped with this, our algorithm avoids projections of the algebraic sets that are decomposed and certain genericity assumptions frequently made when decomposing polynomial systems, such as assumptions about Noether position. This makes it produce fine decompositions on more structured systems where ensuring genericity assumptions often destroys the structure of the system at hand. Practical experiments demonstrate its efficiency compared to state-of-the-art implementations.
Fichier principal
Vignette du fichier
arxiv_version.pdf (292.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY - Attribution

Dates and versions

hal-04000248 , version 1 (22-02-2023)
hal-04000248 , version 2 (09-06-2023)


  • HAL Id : hal-04000248 , version 2


Christian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din. A Direttissimo Algorithm for Equidimensional Decomposition. ISSAC 2023 - 48th International Symposium on Symbolic and Algebraic Computation, Jul 2023, Tromsø, Norway. ⟨hal-04000248v2⟩
21 View
14 Download


Gmail Facebook Twitter LinkedIn More