Efficient checking of separating indeterminates
Commutative rings and modules of finite generation or presentation; number of generators (13E15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)
Let \(P = K[x_1,\dots,x_n]\) be a polynomial ring over a field \(K\) and let \(I\subset P\) be an ideal. Following Definition 2.1 of the paper under review, a re-embedding of \(I\) is a \(K\)-algebra isomorphism \(\Phi : P/I \to P'/I'\), where \(P'\) is a polynomial ring over \(K\) and \(I'\) is an ideal in~\(P'\). A re-embedding \(\Phi : P/I \to P'/I'\) of \(I\) is optimal if, for every re-embedding \(P/I \to P/I\) of \(I\), one has \(\dim(P)\geq \dim(P')\).\N\NThe problem of finding an optimal re-embedding of \(I\) is the algebraic counterpart of embedding the subscheme defined by \(I\) into an affine space of minimal dimension. This problem has been effectively addressed in a series of papers by the second and third authors together with \textit{L. Robbiano} (see [\textit{M. Kreuzer} et al., J. Algebra Appl. 21, No. 9, Article ID 2250188, 20 p. (2022; Zbl 1495.13039); São Paulo J. Math. Sci. 17, No. 1, 242--267 (2023; Zbl 1539.13058); Beitr. Algebra Geom. 65, No. 4, 827--851 (2024; Zbl 1562.14127)] in the bibliography) by means of the method of separating indeterminates (see Definition 2.2). More precisely, they consider Z-separating re-embeddings, which are obtained by computing elimination ideals via substitutions (see also [\textit{M. Kreuzer} and \textit{L. Robbiano}, J. Symb. Comput. 131, Article ID 102445, 30 p. (2025; Zbl 08055671)] in the bibliography).\N\NIn contrast to these earlier works, in the present paper the ideal \(I\) is not assumed to be contained in the homogeneous maximal ideal \(\mathfrak M\) of \(P\). In this very general setting, the authors develop fast algorithms and illustrate them with several instructive examples. They also provide interesting applications by extending the algorithms to Boolean polynomials and using them in the cryptanalysis of round-reduced versions of the AES cryptosystem.
- Algebraic attacks using SAT-solvers
- Boolean Gröbner bases. Theory, algorithms and applications
- CoCoA-5.2.2 and CoCoALib
- Computing border bases
- Cotangent spaces and separating re-embeddings
- Elimination by substitution
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 2206382 (Why is no real title available?)
- msolve. A library for solving polynomial systems
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Re-embeddings of affine algebras via Gröbner fans of linear ideals
- Restricted Gröbner fans and re-embeddings of affine algebras
- SAT solving using XOR-OR-AND normal forms.
- The close relation between border and Pommaret marked bases
This page was built for publication: Efficient checking of separating indeterminates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918454)
