Degree bounds and synchronization in Gr" o bner basis computations for affine semi-regular systems

arXiv:2404.03530 · math.AC, cs.CR, cs.SC, math.AG · Submitted 2024-04-04 · Read on arXiv

math.AC, cs.CR, cs.SC, math.AG

Submitted: 2024-04-04

Updated: 2026-09-01

Terminology

• Homogenization — 21× in this paper · explained in 2 episodes
• Generalization — 3× in this paper · explained in 13 episodes
• Algebraic Invariants — 1× in this paper · explained in 1 episode

Sources

• The complexity of solving a system of equations of the same degree
• On Hilbert-Poincar'{e} series of affine semi-regular polynomial sequences and related Gr\"{o}bner bases
• An upper bound for the solving degree in terms of the degree of regularity

Related papers

• Algebraic Expressivity Certificates for Shallow Polynomial Neural Networks
• Poincar'e Duality and Quadratic Refinements over Laurent Rings
• Key exchange protocol based on circulant matrix action over congruence-simple semiring
• Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks