A syzygial method for equidimensional decomposition
Let \(\mathbb{K}\) be a field with the algebraic closure \(\overline{\mathbb{K}}\), and let \(R = \mathbb{K}[x_1, \dots, x_n]\) be the polynomial ring in \(n\) variables over \(\mathbb{K}\). An \textit{variety} in \({\overline{\mathbb{K}}}^n\) is the set of all common zeros of a collection of polynomials in \(R\). A variety admits a unique decomposition (up to ordering) into finitely many \textit{irreducible varieties}. We call a variety \textit{equidimensional} if all its irreducible components share the same dimension.\N\NGiven a finite sequence \(F = (f_1, \dots, f_r)\) of polynomials in \(R\), denote by \(V(F) \subseteq {\overline{\mathbb{K}}}^n\) the variety defined by \(F\). The objective of this paper is to devise an algorithm that outputs finite sets of polynomials \(G_1, \dots, G_s\subset R\) such that\N\begin{itemize}\N\item[1.] each \(Y_i := V(G_i)\) is equidimensional, and\N\item[2.] \( V(F) = \bigcup_{i=1}^{s} Y_i\).\N\end{itemize}\NSuch a decomposition is called an equidimensional decomposition of \( V(F)\). This paper presents a novel algorithm for computing equidimensional decompositions of varieties using syzygy computations via Gröbner bases. The method avoids several computational bottlenecks present in previous approaches: it requires neither elimination techniques, homological algebra, nor incremental processing of input equations. The algorithm is based on a theorem by Vasconcelos that characterizes local regular sequences through syzygy relations. The author provides a complete algebraic description of his method, proves its correctness, and demonstrates its practical efficiency through extensive benchmarks comparing it against state-of-the-art decomposition algorithms.
- 3264 conics in a second
- A complete algorithm for automated discovering of a class of inequality-type theorems
- A Direttissimo Algorithm for Equidimensional Decomposition
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A Gröbner free alternative for polynomial system solving
- A new efficient algorithm for computing Gröbner bases (F₄)
- A new incremental algorithm for computing Groebner bases
- A new method for solving algebraic systems of positive dimension
- A signature-based algorithm for computing the nondegenerate locus of a polynomial system
- A survey on signature-based algorithms for computing Gröbner bases
- Algorithms for computing triangular decomposition of polynomial systems
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An application of regular chain theory to the study of limit cycles
- An elimination method for polynomial systems
- Associative differential operations
- Basic principles of mechanical theorem proving in elementary geometries
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Complete singularity analysis for the perspective-four-point problem
- Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
- Computing parametric geometric resolutions
- Computing roadmaps in unbounded smooth real algebraic sets. I: Connectivity results
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Dimension-dependent upper bounds for Gröbner bases
- Direct methods for primary decomposition
- Effective equidimensional decomposition of affine varieties
- Elimination methods
- Gröbner bases and primary decomposition of polynomial ideals
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 3973001 (Why is no real title available?)
- scientific article; zbMATH DE number 16648 (Why is no real title available?)
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 622670 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 2077081 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- Ideals generated by \(R\)-sequences
- Ideals, Varieties, and Algorithms
- msolve. A library for solving polynomial systems
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Regular Decompositions
- Ritt-Wu's decomposition algorithm and geometry theorem proving
- The computer algebra system OSCAR. Algorithms and examples (to appear)
- The RegularChains library in Maple 10
- Zum Hilbertschen Nullstellensatz.
This page was built for publication: A syzygial method for equidimensional decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968349)
