Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems
From MaRDI portal
Publication:2132458
DOI10.1016/j.jalgebra.2022.03.002zbMath1492.13036arXiv2203.10021OpenAlexW4220943614MaRDI QIDQ2132458
Alin Bostan, Jérémy Berthomieu, Mohab Safey El Din, Andrew Ferguson
Publication date: 28 April 2022
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.10021
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the generalized MinRank problem
- Variant quantifier elimination
- Generic sequences of polynomials
- Binomial determinants, paths, and hook length formulae
- An asymptotic formula in the theory of compositions
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Sparse FGLM algorithms
- Approximate optimal designs for multivariate polynomial regression
- Positive polynomials in control.
- Degrevlex Gröbner bases of generic complete intersections.
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- A Hilbert Scheme in Computer Vision
- A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
- An inequality for Hilbert series of graded algebras.
- On the Hilbert Function of Determinantal Rings and Their Canonical Module
- Algebraic Degree of Polynomial Optimization
- Critical points and Gröbner bases
- Positive polynomials and robust stabilization with fixed-order controllers
- Algorithms in real algebraic geometry
