Solving bihomogeneous polynomial systems with a zero-dimensional projection

DOI10.1145/3747199.3747563MaRDI QIDQ7288990zbMATH OpenFDO

Authors Matías R. Bender, Laurent Busé, Carles Checa, Elias P. Tsigaridas

Publication date 1 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3747199.3747563

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A criterion for detecting m-regularity
• Algebraic curves and surfaces. A history of shapes
• Algorithms for linearly recurrent sequences of truncated polynomials
• Bigeneric initial ideals, diagonal subalgebras and bigraded Hilbert functions
• Border basis representation of a general quotient algebra
• Computing and using minimal polynomials
• Degröbnerization: a political manifesto
• Direct methods for primary decomposition
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Elimination for generic sparse polynomial systems
• Flat families by strongly stable ideals and a generalization of Gröbner bases
• Gröbner bases and primary decomposition of polynomial ideals
• Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
• scientific article; zbMATH DE number 3857249 (Why is no real title available?)
• scientific article; zbMATH DE number 3513932 (Why is no real title available?)
• Lower bounds for zero-dimensional projections
• Multigraded Castelnuovo-Mumford regularity
• Multigraded Sylvester forms, duality and elimination matrices
• On the complexity exponent of polynomial system solving
• On the complexity of the \(F_5\) Gröbner basis algorithm
• Solving parametric polynomial systems
• Some results and questions on Castelnuovo-Mumford regularity
• Sparse FGLM algorithms
• The Geometry of Syzygies
• The regularity of points in multi-projective spaces.
• Toric eigenvalue methods for solving sparse polynomial systems
• Towards Mixed Gröbner Basis Algorithms
• Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
• Twenty-four hours of local cohomology
• Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems
• Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
• Using Algebraic Geometry
• Yet another eigenvalue algorithm for solving polynomial systems

This page was built for publication: Solving bihomogeneous polynomial systems with a zero-dimensional projection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288990)