Dimension results for extremal-generic polynomial systems over complete toric varieties
From MaRDI portal
Publication:6196136
Abstract: We study polynomial systems with prescribed monomial supports in the Cox rings of toric varieties built from complete polyhedral fans. We present combinatorial formulas for the dimensions of their associated subvarieties under genericity assumptions on the coefficients of the polynomials. Using these formulas, we identify at which degrees generic systems in polytopal algebras form regular sequences. Our motivation comes from sparse elimination theory, where knowing the expected dimension of these subvarieties leads to specialized algorithms and to large speed-ups for solving sparse polynomial systems. As a special case, we classify the degrees at which regular sequences defined by weighted homogeneous polynomials can be found, answering an open question in the Gr"obner bases literature. We also show that deciding whether a sparse system is generically a regular sequence in a polytopal algebra is hard from the point of view of theoretical computational complexity.
Cites work
- scientific article; zbMATH DE number 3843889 (Why is no real title available?)
- scientific article; zbMATH DE number 1194481 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1273646 (Why is no real title available?)
- scientific article; zbMATH DE number 503188 (Why is no real title available?)
- scientific article; zbMATH DE number 2086933 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Affine solution sets of sparse polynomial systems
- Computing minimal multi-homogeneous Bezout numbers is hard
- Computing mixed discriminants, mixed volumes, and permanents
- Convex Bodies The Brunn-MinkowskiTheory
- Criteria for strict monotonicity of the mixed volume of convex polytopes
- Do most polynomials generate a prime ideal?
- Espaces projectifs anisotropes
- Gröbner basis over semigroup algebras. Algorithms and applications for sparse polynomial systems
- Introduction to Toric Varieties. (AM-131)
- Numerical homotopies from Khovanskii bases
- On the Newton polytope of the resultant
- On the complexity of computing Gröbner bases for weighted homogeneous systems
- On the complexity of the \(F_5\) Gröbner basis algorithm
- Reducibility among combinatorial problems
- Rings of Invariants of Tori, Cohen-Macaulay Rings Generated by Monomials, and Polytopes
- Sparse Gröbner bases: the unmixed case
- The expected number of real roots of a multihomogeneous system of polynomial equations
- The number of roots of a system of equations
- Toric border basis
- Toric eigenvalue methods for solving sparse polynomial systems
- Toric varieties
- Unmixing the mixed volume computation
This page was built for publication: Dimension results for extremal-generic polynomial systems over complete toric varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196136)