Towards Mixed Gröbner Basis Algorithms

DOI10.1145/3208976.3209018zbMath1467.13042arXiv1805.03577OpenAlexW3106350071MaRDI QIDQ5120180

Jean-Charles Faugère, Elias P. Tsigaridas, Matías R. Bender

Publication date: 9 September 2020

Published in: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.03577

zbMATH Keywords

toric varietyGröbner basissparse polynomial systemmixed sparse Gröbner basismultihomogeneous polynomial systemsolving polynomial system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (5)

Numerical root finding via Cox rings ⋮ Toric eigenvalue methods for solving sparse polynomial systems ⋮ Chordal graphs in triangular decomposition in top-down style ⋮ Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems ⋮ Guessing Gröbner bases of structured ideals of relations of sequences

This page was built for publication: Towards Mixed Gröbner Basis Algorithms