Obner Bases Research Articles

FROM EUCLID TO ARTIFICIAL INTELLIGENCE

We give 19 proofs of the famous Angle Bisector Theorem from Euclid's Elements. The first proof is the Euclid's original proof, the remaining proofs use the methods of Euclidean Geo\-metry, Trigonometry, Analytic Geometry, Complex Numbers, and Gr\"obner Bases. The Gr\"obner Bases proof is in the area of Automatic Proving and Artificial Intelligence, so that the proofs in a way symbolise the development of mathematics from 300 BC (the Euclid's time) to modern days. We discuss what the proofs illustrate and why they are important for Math Education. All the proofs, except the first one, are original.

Learning a performance metric of Buchberger’s algorithm

What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gr\"obner basis of the ideal these polynomials generate using an iterative procedure based on multivariate long division. The runtime of each step of the algorithm is typically dominated by a series of polynomial additions, and the total number of these additions is a hardware independent performance metric that is often used to evaluate and optimize various implementation choices. In this work we attempt to predict, using just the starting input, the number of polynomial additions that take place during one run of Buchberger's algorithm. Good predictions are useful for quickly estimating difficulty and understanding what features make Gr\"obner basis computation hard. Our features and methods could also be used for value models in the reinforcement learning approach to optimize Buchberger's algorithm introduced in [Peifer, Stillman, and Halpern-Leistner, 2020]. We show that a multiple linear regression model built from a set of easy-to-compute ideal generator statistics can predict the number of polynomial additions somewhat well, better than an uninformed model, and better than regression models built on some intuitive commutative algebra invariants that are more difficult to compute. We also train a simple recursive neural network that outperforms these linear models. Our work serves as a proof of concept, demonstrating that predicting the number of polynomial additions in Buchberger's algorithm is a feasible problem from the point of view of machine learning.

Universal Gröbner bases of toric ideals of combinatorial neural codes

In the 1970s, O'Keefe and Dostrovsky discovered that certain neurons, called place cells, in an animal's brain are tied to its location within its arena. A combinatorial neural code is a collection of $0/1$-vectors which encode the patterns of co-firing activity among the place cells. Gross, Obatake, and Youngs have recently used techniques from toric algebra to study when a neural code is $0$- $1$-, or $2$-inductively pierced: a property that allows one to reconstruct a Venn diagram-like planar figure that acts as a geometric schematic for the neural co-firing patterns. This article examines their work closely by focusing on a variety of classes of combinatorial neural codes. In particular, we identify universal Gr\"obner bases of the toric ideal for these codes.

Structure of small cancellation rings

The theory of small cancellation groups is well known. In this paper we introduce the notion of Group-like Small Cancellation Ring. This is the main result of the paper. We define this ring axiomatically, by generators and defining relations. The relations must satisfy three types of axioms. The major one among them is called the Small Cancellation Axiom. We show that the obtained ring is non-trivial. Moreover, we show that this ring enjoys a global filtration that agrees with relations, find a basis of the ring as a vector space and establish the corresponding structure theorems. It turns out that the defined ring possesses a kind of Gr\"obner basis and a greedy algorithm. Finally, this ring can be used as a first step towards the iterated small cancellation theory which hopefully plays a similar role in constructing examples of rings with exotic properties as small cancellation groups do in group theory. This is a short version of paper arXiv:2010.02836

Gröbner bases for staged trees

In this article we consider the problem of finding generators of the toric ideal associated to a combinatorial object called a staged tree. Our main theorem states that toric ideals of staged trees that are balanced and stratified are generated by a quadratic Gr\"obner basis whose intial terms are squarefree. The proof of this result is based on Sullivant's toric fiber product construction.

Algebraic analysis of rotation data

We develop algebraic tools for statistical inference from samples of rotation matrices. This rests on the theory of D-modules in algebraic analysis. Noncommutative Gr\"obner bases are used to design numerical algorithms for maximum likelihood estimation, building on the holonomic gradient method of Sei, Shibata, Takemura, Ohara, and Takayama. We study the Fisher model for sampling from rotation matrices, and we apply our algorithms for data from the applied sciences. On the theoretical side, we generalize the underlying equivariant D-modules from SO(3) to arbitrary Lie groups. For compact groups, our D-ideals encode the normalizing constant of the Fisher model.

Minimal Solvers for Rectifying from Radially-Distorted Scales and Change of Scales

This paper introduces the first minimal solvers that jointly estimate lens distortion and affine rectification from the image of rigidly-transformed coplanar features. The solvers work on scenes without straight lines and, in general, relax strong assumptions about scene content made by the state of the art. The proposed solvers use the affine invariant that coplanar repeats have the same scale in rectified space. The solvers are separated into two groups that differ by how the equal scale invariant of rectified space is used to place constraints on the lens undistortion and rectification parameters. We demonstrate a principled approach for generating stable minimal solvers by the Gr\"obner basis method, which is accomplished by sampling feasible monomial bases to maximize numerical stability. Synthetic and real-image experiments confirm that the proposed solvers demonstrate superior robustness to noise compared to the state of the art. Accurate rectifications on imagery taken with narrow to fisheye field-of-view lenses demonstrate the wide applicability of the proposed method. The method is fully automatic.

Word operads and admissible orderings

We use Giraudo's construction of combinatorial operads from monoids to offer a conceptual explanation of the origins of Hoffbeck's path sequences of shuffle trees, and use it to define new monomial orders of shuffle trees. One such order is utilised to exhibit a quadratic Gr\"obner basis of the Poisson operad.

Anomaly-free model building with algebraic geometry

We present a method to find anomaly-free gauged Froggatt-Nielsen type models using results from algebraic geometry. These methods should be of general interest for model building beyond the Standard Model (SM) when rational charges are required. We consider models with a gauged $U(1)$ flavor symmetry with one flavon and two Higgs doublets and three right-handed SM singlets to provide three model examples based on different physical assumptions. The models we study are: anomaly-free with no SM neutral heavy chiral fermions, anomaly-free with SM neutral heavy chiral fermions, and supersymmetric with SM neutral heavy chiral fermions where the anomalies cancel via the Green-Schwarz mechanism. With these different models we show how algebraic methods may be used in model building; both to reduce the charge constraints by calculation of Gr\"obner bases, and to find rational solutions to cubic equations using Mordell-Weil generators. Using these tools we find three phenomenologically viable models explaining the observed flavor structure.

Gröbner Bases with Reduction Machines

In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we investigate what happens if we make that choice arbitrarily. It turns out not only this is possible (the fact that this produces a normal form being already known in the literature), but, for a fixed choice of reductors, the obtained normal form is the same no matter the order in which we reduce the monomials. To prove this, we introduce reduction machines, which work by reducing each monomial independently and then collecting the result. We show that such a machine can simulate any such reduction. We then discuss different implementations of these machines. Some of these implementations address inherent inefficiencies in reduction machines (repeating the same computations). We describe a first implementation and look at some experimental results.

Lax Pairs for Linear Hamiltonian Systems

In the paper Lax pairs for linear Hamiltonian systems of differential equations are constructed. In particular, Gr\"obner bases are used for the computations. It is proved that the maps which appear in the construction of Lax pairs are Poisson. Various properties of first integrals of the system which are obtained from the Lax pairs are investigated.

Convergent presentations and polygraphic resolutions of associative algebras

Several constructive homological methods based on noncommutative Gr\"obner bases are known to compute free resolutions of associative algebras. In particular, these methods relate the Koszul property for an associative algebra to the existence of a quadratic Gr\"obner basis of its ideal of relations. In this article, using a higher-dimensional rewriting theory approach, we give several improvements of these methods. We define polygraphs for associative algebras as higher-dimensional linear rewriting systems that generalise the notion of noncommutative Gr\"obner bases, and allow more possibilities of termination orders than those associated to monomial orders. We introduce polygraphic resolutions of associative algebras, giving a categorical description of higher-dimensional syzygies for presentations of algebras. We show how to compute polygraphic resolutions starting from a convergent presentation, and how these resolutions can be linked with the Koszul property.

Cohen-Macaulay Criteria for Projective Monomial Curves via Gröbner Bases

We prove new characterizations based on Gr\"obner bases for the Cohen-Macaulay property of a projective monomial curve.

ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for interlacing polynomials we provide an explicit formula for the $h^\ast$-polynomial in case of complete bipartite graphs. In particular, we show that the $h^\ast$-polynomial is $\gamma$-positive and real-rooted. This proves Gal's conjecture for arbitrary flag unimodular triangulations in this case, and, beyond that, we prove a strengthing due to Nevo and Petersen (2011).

Linear Codes Over $\mathbb F_q$ Are Equivalent to LCD Codes for $q>3$

The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence. For binary and ternary codes the dimension of the hull is also invariant under monomial equivalence and we show that this invariant is determined by the extended weight enumerator of the code.\\ The hull of a code is not invariant under monomial equivalence if $q\geq 4$. We show that every ${\mathbb F}_q $-linear code is monomial equivalent with an LCD code in case $q \geq 4$. The proof uses techniques from Gr\"obner basis theory. We conclude that if there exists an ${\mathbb F}_q $-linear code with parameters $[n,k,d]_q$ and $q \geq 4$, then there exists also a LCD code with the same parameters. Hence this holds for optimal and MDS codes. In particular there exist LCD codes that are above the Gilbert-Varshamov bound if $q$ is a square and $q\geq 49$ by the existence of such codes that are algebraic geometric.\\ Similar results are obtained with respect to Hermitian LCD codes.

Symbolic Solutions of Simultaneous First-Order PDEs in One Unknown

We propose and implement an algorithm for solving an overdetermined system of partial differential equations in one unknown. Our approach relies on Bour-Mayer method to determine compatibility conditions via Jacobi-Mayer brackets. We solve compatible systems recursively by imitating what one would do with pen and paper: Solve one equation, substitute the solution into the remaining equations and iterate the process until the equations of the system are exhausted. The method we employ for assessing the consistency of the underlying system differs from the traditional use of differential Gr\obner bases yet seems more efficient and straightforward to implement. We are not aware of a computer algebra system that adopts the procedure we advocate in this work.

Hamiltonian identifiability assisted by a single-probe measurement

We study the Hamiltonian identifiability of a many-body spin-1/2 system assisted by the measure- ment on a single quantum probe based on the eigensystem realization algorithm (ERA) approach employed in Phys. Rev. Lett. 113, 080401 (2014). We demonstrate a potential application of Gr\"obner basis to the identifiability test of the Hamiltonian, and provide the necessary experimental resources, such as the lower bound in the number of the required measurement points, the upper bound in total required evolution time, and thus the total measurement time. Focusing on the examples of the identifiability in the spin chain model with nearest-neighboring interaction, we classify the spin-chain Hamiltonian based on its identifiability, and provide the control protocols to engineer the nonidentifiable Hamiltonian to be an identifiable Hamiltonian.

The Ext Algebra and a New Generalization ofD-Koszul Algebras

We generalise Koszul and D-Koszul algebras by introducing a class of graded algebras called (D,A)-stacked algebras. We give a characterisation of (D,A)-stacked algebras and show that their Ext algebra is finitely generated as an algebra in degrees 0, 1, 2 and 3. In the monomial case, we give an explicit description of the Ext algebra by quiver and relations, and show that the ideal of relations has a quadratic Gr\obner basis; this enables us to give a regrading of the Ext algebra under which the regraded Ext algebra is a Koszul algebra.

The polynomial form of the scattering equations is anH-basis

We prove that the polynomial form of the scattering equations is a Macaulay H-basis. We demonstrate that this H-basis facilitates integrand reduction and global residue computations in a way very similar to using a Gr\"obner basis, but circumvents the heavy computation of the latter. As an example, we apply the H-basis to prove the conjecture that the dual basis of the polynomial scattering equations must contain one constant term.

On the annihilator ideal of an inverse form

Let $K$ be a field. We simplify and extend work of Althaler \& D\"ur on finite sequences over $K$ by regarding $K[x^{-1},z^{-1}]$ as a $K[x,z]$ module, and studying forms in $K[x^{-1},z^{-1}]$ from first principles. Then we apply our results to finite sequences. First we define the annihilator ideal $I_F$ of a non-zero form $F\in K[x^{-1},z^{-1}]$, a homogeneous ideal. We inductively construct an ordered pair ($f_1$\,,\,$f_2$) of forms which generate $I_F$\,; our generators are special in that $z$ does not divide the leading grlex monomial of $f_1$ but $z$ divides $f_2$\,, and the sum of their total degrees is always $2-|F|$, where $|F|$ is the total degree of $F$. We show that $f_1,f_2$ is a maximal regular sequence for $I_F$, so that the height of $I_F$ is 2. The corresponding algorithm is $\sim |F|^2/2$. The row vector obtained by accumulating intermediate forms of the construction gives a minimal grlex Gr\"obner basis for $I_F$ for no extra computational cost other than storage and apply this to determining $\dim_K (K[x,z] /I_F)$\,. We show that either the form vector is reduced or a monomial of $f_1$ can be reduced by $f_2$\,. This enables us to efficiently construct the unique reduced Gr\"obner basis for $I_F$ from the vector extension of our algorithm. Then we specialise to the inverse form of a finite sequence, obtaining generator forms for its annihilator ideal and a corresponding algorithm which does not use the last 'length change' of Massey. We compute the intersection of two annihilator ideals using syzygies in $K[x,z]^5$. This improves a result of Althaler \& D\"ur. Finally, dehomogenisation induces a one-to-one correspondence ($f_1$\,,$f_2$) $\mapsto$ (minimal polynomial, auxiliary polynomial), the output of the author's variant of the Berlekamp-Massey algorithm. So we can also solve the LFSR synthesis problem via the corresponding algorithm for sequences.