Finding binomials in polynomial ideals
 Anders Jensen^{1},
 Thomas Kahle^{2}Email author and
 Lukas Katthän^{3}
https://doi.org/10.1186/s4068701701060
© The Author(s) 2017
Received: 10 October 2016
Accepted: 24 March 2017
Published: 1 September 2017
Abstract
We describe an algorithm which finds binomials in a given ideal \(I\subset \mathbb {Q}[x_1,\dots ,x_n]\) and in particular decides whether binomials exist in I at all. Binomials in polynomial ideals can be well hidden. For example, the lowest degree of a binomial cannot be bounded as a function of the number of indeterminates, the degree of the generators, or the Castelnuovo–Mumford regularity. We approach the detection problem by reduction to the Artinian case using tropical geometry. The Artinian case is solved with algorithms from computational number theory.
Keywords
Algorithm Binomial detection Binomial ideal Tropical geometryMathematics Subject Classification
Primary: 68W99 Secondary: 11R04 11Y16 11Y40 13P05 13P99 14T05 68W301 Background
The goal of this paper is to prove the following result.
Theorem 1
There is a deterministic algorithm that, given generators, decides whether an ideal in the polynomial ring \(\mathbb {Q}[x_1,\dots ,x_n]\) contains nonzero binomials.
Theorem 1 answers a fundamental question in computational algebra, but we envision that it will also be useful for applications. To name just a few, when implementing mesoprimary decomposition of binomial ideals [11], a test for binomials is necessary. In the theory of retractions of polytopal algebras, [3, Conjecture B] is connected to the existence of binomials and monomials in the kernels of certain maps (albeit after a graded automorphism of the ambient ring). In [20], Sontag argues that polynomials with few terms in an ideal yield the best restrictions on the possible sign patterns of changes that a steady state of a chemical reaction network can undergo under perturbation. Theorem 1 can also be seen as a first step to the broader problem of deciding whether an ideal contains a sparse polynomial, or finding the sparsest polynomial. For example, Jürgen Herzog suggested the problem of determining the length of the shortest polynomial in a standard determinantal ideal.
It does not seem possible to prove Theorem 1 by standard arguments using Gröbner bases. For example, the ideal \(\langle x^2+x+1\rangle \subset \mathbb {Q}[x]\) contains \(x^31\), but its generator, trivially, is a universal Gröbner basis. Moreover, the lowest degree binomials in an ideal need not satisfy a general upper degree bound in terms of common invariants such as Castelnuovo–Mumford regularity or primary decomposition.
Example 2
Our approach to Theorem 1 can be summarized as follows. Given an ideal \(I\subset \mathbb {Q}[x_1,\dots ,x_n]\), we pass to its Laurent extension \(J = I\mathbb {Q}[x^\pm _1, \dots , x^\pm _n]\), which contains binomials if and only if I contains binomials (Lemma 5). We then show in Section 3 that there exists an ideal \(J' \subseteq \mathbb {Q}[y^\pm _1, \dots , y^\pm _m]\) such that \(\mathbb {Q}[y^\pm _1, \dots , y^\pm _m]/J'\) is Artinian, and the sets of binomials in J and \(J'\) can easily be computed from each other (Proposition 12 and Theorem 13). This reduction is achieved by means of tropical geometry. The Artinian case is easier since the (images of the) indeterminates \(y_1,\dots , y_m\) in \(\mathbb {Q}[y^\pm _1, \dots , y^\pm _m]/J'\) have matrix representations that commute. This leads to the constructive membership problem for commutative matrix (semi)groups [1], which is already solved (see [9] for a survey). The completed algorithm appears as Algorithm 22 in Section 5.
1.1 Related work and variations of the problem
The question whether an ideal is a binomial ideal, that is, whether it can be generated by binomials alone, can be decided by computing a reduced Gröbner basis [6, Corollary 1.2]. In the case of a homogeneous ideal one can even do it with linear algebra only [5, Proposition 3.7].
Moreover, deciding for given monomials \(\mathbf {x}^u\) and \(\mathbf {x}^v\) whether there exists some scalar \(\lambda \) such that \(\mathbf {x}^u\lambda \mathbf {x}^v\) is contained in a given ideal I is also not too difficult. For this problem, it suffices to compute the unique normal forms of \(\mathbf {x}^u\) and \(\mathbf {x}^v\) modulo a Gröbner basis of I and check whether they are scalar multiples of each other. Using this observation, one can decide whether I contains a binomial of a given degree by brute force. However, this approach cannot be used to prove Theorem 1, because there is no a priori degree bound on a binomial in I (cf. Example 2).
It appears that primary decomposition is not helpful for the problem at hand. For example, the ideal \(\langle (xy)(zw)\rangle = \langle xy\rangle \cap \langle zw\rangle \) does not contain a binomial, even though its minimal primes are generated by binomials.
Finally, the detection of monomials in a polynomial ideal is quite simple using ideal quotients: an ideal \(I\subset \mathbb {Q}[x_1,\dots ,x_n]\) contains a monomial if and only if \(((\cdots (I:x_1^\infty )\cdots ):x_n^\infty ) = (I:(x_1\cdots x_n)^\infty ) = \mathbb {Q}[x_1,\dots ,x_n]\). The colon ideals \((I:x_i^\infty )\) can readily be computed with Gröbner bases [8, Section 1.8.9]. It was discovered several times that extensions of this yield all monomials (see [17], [19, Algorithm 4.4.2], or [13, Tutorial 50]).
2 Binomials in ideals
As in the case of binomial ideals, it is more convenient to work not only with the binomials in an ideal, but with the entire subspace they generate. Throughout this section, let \(\mathbb {K}\) be any fixed field and denote by \(S = \mathbb {K}[x_1,\dots ,x_n]\) the polynomial ring in n indeterminates with coefficients in \(\mathbb {K}\). We occasionally use the notation \(\mathbf {x}^a := \prod _i x_i^{a_i}\) for \(a = (a_1, \cdots , a_n)\in \mathbb {N}^n\).
Definition 3
Let \(I\subset S\) be an ideal. The binomial part \({{\mathrm{Bin}}}(I)\) of I is the \(\mathbb {K}\)subspace of I spanned by all binomials in I.
Proposition 4
The binomial part of any ideal is a binomial ideal.
Proof
Let \(I \subset S\) be an ideal and \(B\subset I\) its binomial part. Then every element \(b\in B\) is a linear combination of binomials. Multiplying it with an arbitrary \(f\in S\) yields some linear combination of monomial multiples of the binomials in b. Since I is an ideal, those monomial multiples are contained in B too and so is fb. Thus, B is an ideal. Moreover, the ideal B is binomial, since an ideal is in particular generated by any set that generates it as a vector space. \(\square \)
By the same argument, a binomial ideal is as a vector space spanned by the binomials it contains. In particular, a binomial ideal equals its binomial part.
We now discuss ring extensions in this context. Denote by \(T = \mathbb {K}[x^\pm _1, \dots , x^\pm _n]\) the Laurent polynomial ring corresponding to S. We extend the notion of \({{\mathrm{Bin}}}(I)\) to this ring in the natural way.
Lemma 5
For any ideal \(I \subset S\), it holds that \({{\mathrm{Bin}}}(I T) = {{\mathrm{Bin}}}(I)T\). In particular, I contains a binomial if and only if the extension of I to T contains a binomial. Moreover, if \((I:x_1 \cdots x_n) = I\), then \({{\mathrm{Bin}}}(I) = {{\mathrm{Bin}}}(I T) \cap S\).
Proof
The inclusion “\(\supseteq \)” is clear because \(I \subset I T\). For the other inclusion, note that any binomial in IT can be multiplied with a monomial to obtain a binomial in I. The last statement follows from the fact the hypothesis implies that \(I = I T \cap S\).
The binomial part of a proper ideal \(I \subset T\) is determined by a lattice \(L \subset \mathbb {Z}^n\) and a homomorphism \(\phi : L \rightarrow \mathbb {K}^\times \) (called a partial character in [6]). According to [6, Theorem 2.1], the binomial part of I is the binomial ideal \(\langle \mathbf {x}^m  \phi (m) :m \in L\rangle \).
Remark 6
Lemma 7

I contains a binomial if and only if \(IT'\) contains a binomial, and

\({{\mathrm{Bin}}}(I) = {{\mathrm{Bin}}}(I T') \cap T\).
Proof
For the last claim, we only need to show the inclusion \({{\mathrm{Bin}}}(I) \supseteq {{\mathrm{Bin}}}(I T') \cap T\). Choose a \(\mathbb {K}\)basis \({\mathcal B}\) of \({{\mathrm{Bin}}}(I)\). By the argument above, it is also a \(\mathbb {K}'\)basis of \({{\mathrm{Bin}}}(I T')\), and thus, every binomial \(b \in {{\mathrm{Bin}}}(I T')\) has a unique expansion in this basis. Hence, b lies in T if and only if its coefficients in this expansion lie in \(\mathbb {K}\). But the latter implies that \(b \in {{\mathrm{Bin}}}(I)\). \(\square \)
Remark 8
Example 9
Remark 8 shows that the binomial part is preserved when extending the coefficient field and then contracting back. It is not generally true that binomial parts survive contraction followed by extension. For example, \(\langle x\sqrt{2}\rangle \subset \mathbb {Q}(\sqrt{2})[x]\) contracts to \(\langle x^22\rangle \subset \mathbb {Q}[x]\) which in turn extends to \(\langle x^2  2\rangle \subset \mathbb {Q}(\sqrt{2})[x]\) by Lemma 7.
3 Reducing to the Artinian case via tropical geometry
Our eventual goal it to compute \({{\mathrm{Bin}}}(I)\) for arbitrary ideals \(I \subset \mathbb {Q}[x_1,\dots ,x_n]\). In this section, we use tropical geometry which means that we have to work with the extension of I to the Laurent polynomial ring. By Lemma 5, this is sufficient to determine whether \({{\mathrm{Bin}}}(I)\) is empty or not. Moreover, if \((I : x_1 \cdots x_n) = I\) then our methods determine all of \({{\mathrm{Bin}}}(I)\).
If I is a prime ideal over an algebraically closed field, then tropical geometry yields a complete answer: the ideal contains binomials if and only if the tropical variety is contained in a tropical hypersurface of a binomial, i.e., in an ordinary hyperplane (Corollary 14). In fact, one implication is immediate from the following definitions. The algebraically closedness assumption is easy to relax, but if the ideal is not prime the tropical variety alone does not reveal binomial containment as the following example demonstrates.
Example 10
The principal ideal \(\langle (x1)(x2)\rangle \subset \mathbb {C}[x]\) has tropical variety \(\{0\}\). It cannot contain a binomial, since such binomial would have roots with different moduli, which binomials cannot have.
However, expanding on the idea from the prime case we can use tropical geometry to reduce binomial detection to the case of ideals with Artinian quotients, which we call Artinian ideals for short. The results in this section hold for more general coefficient fields than \(\mathbb {Q}\). To this end, let \(\mathbb {K}\) be a field and \({\overline{\mathbb {K}}}\) its algebraic closure. The reader interested only in Theorem 1 can mentally replace \(\mathbb {K}\) by \(\mathbb {Q}\). It is notationally convenient to understand the Laurent ring \(\mathbb {K}[x^\pm _1, \dots , x^\pm _n]\) as the group ring \(\mathbb {K}[\mathbb {Z}^n]\). This is the ambient ring for this section.
Definition 11
If \(L=\mathbb {Z}^n\) and I is homogeneous, the definition can be stated in terms of initial ideals of homogeneous ideals in a polynomial ring. Then T(I) is the support of a subfan of the Gröbner fan of \(I\cap \mathbb {K}[\mathbb {N}^n]\), a fan in \(\mathbb {Q}^n\) that has one cone for each initial ideal of \(I\cap \mathbb {K}[\mathbb {N}^n]\). Since \({{\mathrm{in}}}_\omega (I) \ne \mathbb {K}[L]\) can be decided by Gröbner bases, the definition can be turned into an algorithm computing tropical varieties [2].
If a polynomial f is a binomial, then \(T(\langle f\rangle )\) is a hyperplane (or empty) and the Newton polytope of f is a line segment orthogonal to \(T(\langle f\rangle )\). The inclusion \(T(\langle f\rangle )\supset T(I)\) for \(f\in I\) implies that if I contains a binomial f, then the Newton polytope of f must be perpendicular to T(I). Thus, if I contains a binomial then also \(I\cap \mathbb {K}[T(I)^\perp \cap L]\) contains a binomial. The following proposition extends this to all of \({{\mathrm{Bin}}}(I)\).
Proposition 12
Proof
Let \(f\in I\) be a binomial generator of the lefthand side. Then the Newton polytope of f is perpendicular to T(I), meaning that \(\mathbf {x}^uf\in I \cap \mathbb {K}[T(I)^\perp \cap L]\) for some \(u\in L\). Hence, \(f=\mathbf {x}^uf\mathbf {x}^{u}\in {{\mathrm{Bin}}}(I \cap \mathbb {K}[T(I)^\perp \cap L]) \mathbb {K}[L]\). The other containment is clear since \(I \cap \mathbb {K}[T(I)^\perp \cap L] \subset I\). \(\square \)
The lattice \(T(I)^\perp \cap L\) is a saturated lattice in L, and therefore, after a multiplicative change of coordinates, we may assume that \((T(I)^\perp \cap L)\times \{0\}^{nm}=\mathbb {Z}^{m}\times \{0\}^{nm}\subset \mathbb {Z}^n=L\) with \(m=\dim (T(I)^\perp )\). Generators for \(I\cap \mathbb {K}[T(I)^\perp \cap L]\) can then be computed by the elimination \(I\cap \mathbb {K}[x_1^\pm ,\dots ,x_m^\pm ]\). This can be reduced to a Gröbner basis computation in the polynomial ring by first passing to the saturation \((I:(x_{m+1}\cdots x_n)^\infty )\). The following theorem reduces the problem of deciding whether an ideal contains a binomial to the case of Artinian ideals.
Theorem 13
Let \(\mathbb {K}\) be any field, L an integer lattice and \(I\subset \mathbb {K}[L]\) an ideal. Then \(I\cap \mathbb {K}[T(I)^\perp \cap L]\) is an Artinian ideal in \(\mathbb {K}[T(I)^\perp \cap L]\).
Proof
Now we turn to the proof of the theorem. For this, choose \(L' := T(I)^\perp \cap L\). Then \(\iota ^*_\mathbb {Q}(T(I)) = \{0\}\), because restricting a linear map to its kernel yields zero. On the other hand, it clearly holds that \(\mathbb {K}[\iota ]^{1}(I) = I \cap \mathbb {K}[L']\), because \(\mathbb {K}[\iota ]\) is an inclusion. It follows that \(\dim T(I \cap \mathbb {K}[L']) = 0\). Finally, by the Bieri–Groves theorem [15, Theorem 3.3.5], this is also the dimension of the variety of \(I \cap \mathbb {K}[L']\), and hence, this ideal is Artinian. \(\square \)
That our definition of tropical varieties is compatible with that in [15] follows from the Fundamental Theorem of Tropical Geometry [15, Theorem 3.2.3]. We employ [15, Corollary 3.2.13] when \(\mathbb {K}\) is not algebraically closed, which is possible since extending the field does not affect the tropical varieties as they are defined via initial ideals that are computable via Gröbner bases. Similarly, if the field does not come with a nontrivial valuation (which is the case here), one may extend it to the field of generalized Puiseux series which has a nontrivial valuation. See also [15, Theorem 3.1.3].
The preceding theorem allows us to determine when a prime ideal contains a binomial.
Corollary 14
Let L be an integer lattice and \(I\subset \mathbb {K}[L]\) an ideal. If the extension \(I {\overline{\mathbb {K}}}[L] \subset {\overline{\mathbb {K}}}[L]\) of I to the algebraic closure is prime, then I contains a binomial if and only if T(I) is contained in a hyperplane, i.e., \(T(I)^\perp \ne \{0\}\).
Proof
By Lemma 7 we may assume that \(\mathbb {K}= {\overline{\mathbb {K}}}\). Moreover, by Proposition 12 we can consider \(I' := I \cap \mathbb {K}[T(I)^\perp \cap L]\) instead of I. Now, if \(T(I)^\perp = \{0\}\), then \(I' = \langle 0\rangle \) does not contain a binomial. On the other hand, if \(T(I)^\perp \ne \{0\}\), then \(I'\) is a proper Artinian ideal. Hence, after choosing an identification \(\mathbb {K}[T(I)^\perp \cap L] = \mathbb {K}[y^\pm _1, \dots , y^\pm _m]\), \(I'\) contains nonconstant univariate Laurent polynomials in each of the \(y_i\) and in particular a Laurent polynomial \(f \in \mathbb {K}[y_1^\pm ]\). Because \(\mathbb {K}\) is algebraically closed, we can factor f as \(f = c y_1^a\prod _j (y_1\lambda _j)\) with \(c, \lambda _j \in \mathbb {K}\) and \(a \in \mathbb {Z}\). One factor is contained both in \(\mathbb {K}[T(I)^\perp \cap L]\) and in I (because I is prime) and hence in \(I'\). Thus, \({{\mathrm{Bin}}}(I') \ne \{0\}\). \(\square \)
The intention is to apply Theorem 13 and Proposition 12 to reduce the computation of \({{\mathrm{Bin}}}(I)\) to the Artinian case for arbitrary \(I \subset \mathbb {K}[L]\). To proceed, we must be able to compute the lattice \(T(I)^\perp \cap L\). We formulate the following algorithms in the Laurent ring, but using saturations the necessary computations can be carried out in a polynomial ring.
It is possible to either compute the entire Gröbner fan or to apply the traversal strategy of [2] even if I is not homogeneous to find T(I), but both strategies have several drawbacks; a problematic one being that T(I) can easily consist of millions of polyhedral cones. For this reason we offer an approach to directly compute \({{\mathrm{span}}}(T(I))\subseteq \mathbb {Q}^n\). We will make the assumption that we have an algorithm with the following specification.
Algorithm 15
(Tropical Curve)
Input: Generators for an ideal \(I\subset \mathbb {K}[L]\) defining T(I) of dimension 1.
Output: The rays of T(I).
One such algorithm relying on tropical bases is presented in [2]. Another one relying on projections and elimination can be found in Andrew Chan’s thesis [4]. We use Algorithm 15 to find a nontrivial vector in T(I) as follows:
Algorithm 16
Input: Generators for an ideal \(I\subset \mathbb {K}[L]\) with \(d = \dim (I)>0\).
 1.
Choose \(d1\) polynomials \(u_1,\cdots , u_{d1} \in {{\mathrm{span}}}_\mathbb {K}\{1, x_1,\dots ,x_n\}\) so that
\(\dim (I + \langle u_1, \cdots ,u_{d1}\rangle ) = 1\).
 2.
Compute \(T(I + \langle u_1, \cdots ,u_{d1}\rangle )\) using Algorithm 15.
 3.
Return a primitive generator for one of the rays of \(T(I + \langle u_1, \cdots ,u_{d1}\rangle )\).
The returned vector is indeed contained in T(I), because \(T(I + \langle u_1, \cdots ,u_{d1}\rangle ) \subseteq T(I)\).
Remark 17
The dimension condition in the first step holds for a Zariski open subset of \({{\mathrm{span}}}_\mathbb {K}\{1, x_1,\dots ,x_n\}\). Therefore, these polynomials could be picked at random and checked to satisfy the dimension condition. There is also a deterministic way using stable intersections and rational functions as coefficients. Building on techniques similar to [10, Lemma 3.3], one can always find suitable univariate linear polynomials.
We can now state the algorithm to compute \({{\mathrm{span}}}(T(I))\).
Algorithm 18
Input: Generators for an ideal \(I\subset \mathbb {K}[x^\pm _1, \dots , x^\pm _n]\).
 1.
Let \(d := \dim (I)\).
 2.
If \(\dim (I)=0\), then return the basis \(\emptyset \) for \(\{0\}\).
 3.
Compute a primitive vector \(v\in T(I)\) using Algorithm 16.
 4.
Compute an invertible matrix \(M\in \mathbb {Z}^{n\times n}\) such that \(Mv = (0,\dots ,0,1)\).
 5.
Compute generators of the ideal \(I' = \phi (I)\) where \(\phi : \mathbb {K}[x^\pm _1, \dots , x^\pm _n]\rightarrow \mathbb {K}[y_1^\pm ,\dots ,y_n^\pm ]\) is the multiplicative coordinate change induced by \(y_i = \prod _{j=1}^n x_j^{M_{ij}}\).
 6.
Compute \(J'=I'\cap \mathbb {K}[y_1^\pm ,\dots ,y_{n1}^\pm ]\).
 7.
Recursively compute generators U for \({{\mathrm{span}}}(T(J'))\subseteq \mathbb {Q}^{n1}\).
 8.
Return \(\{v\}\cup \{M^{1}(u\oplus (0)): u\in U\}\).
4 The Artinian case
The proof of Theorem 1 is finished once we describe how to compute ideal generators for the binomial part \({{\mathrm{Bin}}}(I)\) of an ideal \(I \subset T\) with Artinian quotient T / I, where \(T = \mathbb {Q}[y^\pm _1, \dots , y^\pm _m]\) as above. For \(1 \le i \le m \), let \(M_i: T/I \rightarrow T/I\) denote the linear endomorphism induced by multiplication with \(y_i\). With \(\ell = \dim _\mathbb {Q}T/I\) let \(\mathbb {K}\) be the finite extension of \(\mathbb {Q}\) which contains the \(\ell \)th roots of the determinants of the \(M_i\). Define \(M'_i = M_i / \root \ell \of {\det M_i}\). By Remark 8, it suffices to determine the binomial part of the extension \(I\mathbb {K}[y^\pm _1, \dots , y^\pm _m]\). This computation can be translated into a membership problem in the multiplicative group generated by the \(M_i\).
Proposition 19
Proof
The binomial \(\mathbf {y}^e  \lambda \) is contained in I if and only if \(\prod _i (M_i)^{e_i} = \lambda {{\mathrm{Id}}}_{T/I}\). Taking determinants of both sides yields that in this case \(\lambda ^\ell = \prod _i (\det M_i)^{e_i}\). So the claim follows from the definition of the \(M_i'\). \(\square \)
The matrices \(M_i'\) commute, are invertible and have entries in a finite extension of \(\mathbb {Q}\). In this situation, [1, Theorem 1.2, Section 6.4] gives an algorithm that, for any matrices \(M_1', \ldots , M_m'\) with entries in a number field, computes a basis for the lattice of exponents \(e \in \mathbb {Z}^m\) satisfying (4.1). A more general version is [14, Algorithm 8.3]. Both rely on the LLL lattice basis reduction algorithm.
Remark 20
The commutativity of the matrices is key for algorithmic treatment. For general matrix semigroups, several problems are known to be algorithmically undecidable (see, for example, the table in the end of [9]). In particular, there is no Turing machine program that can decide whether there is a relation among given \((3\times 3)\) matrices [12]. It is also undecidable if a semigroup generated by eight \((3\times 3)\) integer matrices contains the zero matrix [18]. This result of Paterson is an important tool to prove other undecidability results. For invertible matrices, group membership is unsolvable for matrices of format \((4\times 4)\) and larger [16]. Our methods are therefore not directly applicable to polynomials in noncommutative variables.
Finally, the binomial part of the radical of an Artinian ideal \(I \subset \mathbb {K}[y^\pm _1, \dots , y^\pm _m]\) can be computed without first computing the radical itself.
Proposition 21
For \(e \in \mathbb {Z}^m\), there exists a \(\lambda \in \mathbb {K}\) such that \(\mathbf {y}^e  \lambda \in \sqrt{I}\) if and only if \(\prod _{i=1}^m (M_i)^{e_i}\) has only one eigenvalue over the algebraic closure \({\overline{\mathbb {K}}}\). In this case, \(\lambda = \prod _i (\det M_i)^{e_i/\ell }\).
Proof
Let \(M = \prod _{i=1}^m (M_i)^{e_i}\). Some power of \(\mathbf {y}^e  \lambda \) lies in I if and only if \(M  \lambda {{\mathrm{Id}}}_{T/I}\) is nilpotent. Choose a basis such that M is upper triangular. Then \(M  \lambda {{\mathrm{Id}}}_{T/I}\) is nilpotent if and only if all entries on the main diagonal of M equal \(\lambda \). This equivalent to M having \(\lambda \) as its sole eigenvalue. Computing the determinant of M then yields the claimed expression for \(\lambda \). \(\square \)
Let \(V \subseteq T/I\) be the direct sum of all eigenspaces of \(M_1\). Then the restriction \(M_1_V\) of \(M_1\) to V is diagonalizable. Since the \(M_i\) commute, the same holds for all other \(M_i_V\). Moreover, the set of eigenvalues of \(M_i_V\) equals the set of eigenvalues of \(M_i\) for each i.
5 Algorithm
To facilitate an implementation of the methods in this paper, we formulate the complete algorithm. In this formulation, the algorithm returns generators of the Laurent extension \({{\mathrm{Bin}}}(I)\mathbb {Q}[x^\pm _1, \dots , x^\pm _n]\) which, by means of Lemma 5, yields the desired algorithm for Theorem 1.
Algorithm 22
Input: Generators \(f_1,\dots ,f_s\) for an ideal \(I \subset \mathbb {Q}[x_1,\dots ,x_n]\)
 1.
Let \(J= \langle f_1,\dots ,f_s\rangle \subset \mathbb {Q}[x^\pm _1, \dots , x^\pm _n]\) be the Laurent extension of I.
 2.
Compute the orthogonal complement \(T(J)^\perp \) of the tropical variety of J by Algorithm 18.
 3.
Compute a basis \(\{b^{(1)},\dots , b^{(m)}\}\) of the integer lattice \(L = T(J)^\perp \cap \mathbb {Z}^n\). Let \(\mathbb {Q}[y^\pm _1, \dots , y^\pm _m]\) with \(y_j = \mathbf {x}^{b^{(j)}}\) be the resulting Laurent polynomial subring of \(\mathbb {Q}[x^\pm _1, \dots , x^\pm _n]\).
 4.
Compute \(K = J\cap \mathbb {Q}[L] \subset \mathbb {Q}[y^\pm _1, \dots , y^\pm _m]\) as the preimage of J under the inclusion of \(\mathbb {Q}\)algebras \(\mathbb {Q}[y^\pm _1, \dots , y^\pm _m]\rightarrow \mathbb {Q}[x^\pm _1, \dots , x^\pm _n]\).
 5.
Pick a basis of the finitedimensional \(\mathbb {Q}\)algebra \(\mathbb {Q}[y^\pm _1, \dots , y^\pm _m]/K\) and compute the matrix representations \(M_i\) of the linear maps given by multiplication with \(y_i\).
 6.
Construct a number field \(\mathbb {K}\) that contains all \(\ell \)th roots of the determinants of the \(M_i\), where \(\ell := \dim _\mathbb {Q}\mathbb {Q}[y^\pm _1, \dots , y^\pm _m]/K\). Compute \(M_i' = M_i/\root \ell \of {\det M_i}\)
 7.
Compute a basis \(\{c^{(1)},\dots , c^{(t)}\}\) of the lattice \(E\subset \mathbb {Z}^m\) of exponents satisfying (4.1), for example using the algorithm given in [1].
 8.
For each \(i=1,\dots ,t\), compute \(\lambda _i\), such that \(\mathbf {y}^{c^{(i)}}  \lambda _i \in K\), for example, by using \(\prod _{j}(M_j)^{c^{(i)}_j} = \lambda _i {{\mathrm{Id}}}\). Then \({{\mathrm{Bin}}}(K) = \langle \mathbf {y}^{c^{(1)}}  \lambda _1,\dots , \mathbf {y}^{c^{(t)}}  \lambda _t\rangle \subset \mathbb {Q}[y^\pm _1, \dots , y^\pm _m]\).
 9.
Return generators of \({{\mathrm{Bin}}}(J)\) by substituting \(\mathbf {x}^{b^{(j)}}\) for \(y_j\) in the generators of \({{\mathrm{Bin}}}(K)\).
Acknowledgements
The authors are grateful to Bernd Sturmfels for suggesting to approach the problem through tropical geometry and for constant encouragement. The application of tropical geometry to binomial containment was pointed out to the first author by Douglas Lind. Alice Silverberg and Hendrik W. Lenstra provided valuable help in navigating the computational number theory literature, in particular, locating a copy of [7].
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Declarations
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
 Babai, L., Beals, R., Cai, Jy., Ivanyos, G., Luks, EM.: Multiplicative equations over commuting matrices. In: Proceedings of the 7th Annual ACMSIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996), pp. 498–507. ACM, New York (1996)Google Scholar
 Bogart, T., Jensen, A.N., Speyer, D., Sturmfels, B., Thomas, R.R.: Computing tropical varieties. J. Symb. Comput. 42(1–2), 54–73 (2007)MathSciNetView ArticleMATHGoogle Scholar
 Bruns, W., Gubeladze, J.: Polytopal linear retractions. Trans. Am. Math. Soc. 354(1), 179–203 (2002)MathSciNetView ArticleMATHGoogle Scholar
 Chan, A.: Gröbner Bases Over Fields with Valuations and Tropical Curves by Coordinate Projections, Ph.D. thesis, University of Warwick (2013)Google Scholar
 Conradi, C., Kahle, T.: Detecting binomiality. Adv. Appl. Math. 71, 52–67 (2015)MathSciNetView ArticleMATHGoogle Scholar
 Eisenbud, D., Sturmfels, B.: Binomial ideals. Duke Math. J. 84(1), 1–45 (1996)MathSciNetView ArticleMATHGoogle Scholar
 Ge, G.: Algorithms Related to Multiplicative Representations, Ph.D. thesis, University of California, Berkeley (1993)Google Scholar
 Greuel, G.M.: A Singular Introduction to Commutative Algebra, 2nd edn. Springer, New York (2007)MATHGoogle Scholar
 Halava, V.: Decidable and Undecidable Problems in Matrix Theory, Turku Centre for Computer Science (1997)Google Scholar
 Jensen, A.N., Yu, J.: Stable intersection of tropical varieties. J. Algebr. Comb. 43(1), 101–127 (2016)MathSciNetView ArticleMATHGoogle Scholar
 Kahle, T., Miller, E.: Decompositions of commutative monoid congruences and binomial ideals. Algebra Number Theory 8(6), 1297–1364 (2014)MathSciNetView ArticleMATHGoogle Scholar
 Klarner, D.A., Birget, J.C., Satterfield, W.: On the undecidability of the freeness of integer matrix semigroups. Int. J. Algebra Comput. 1(2), 223–226 (1991)MathSciNetView ArticleMATHGoogle Scholar
 Kreuzer, M., Robbiano, L.: Computational Commutative Algebra 2. Springer, New York (2005)MATHGoogle Scholar
 Lenstra, H., Silverberg, A.: Algorithms for Commutative Algebras Over the Rational Numbers, Foundations of Computational Mathematics (2016), To appearGoogle Scholar
 Maclagan, D., Sturmfels, B.: Introduction to Tropical Geometry, Graduate Studies in Mathematics, vol. 161. AMS, Providence, RI (2015)Google Scholar
 Mihaĭlova, K.A.: The occurrence problem for direct products of groups. Dokl. Akad. Nauk SSSR 119(6), 1103–1105 (1958)MathSciNetGoogle Scholar
 Miller, E.: Finding All Monomials in a Polynomial Ideal, Preprint (2016)Google Scholar
 Paterson, M.S.: Unsolvability in \(3\times 3\) matrices. Stud. Appl. Math. 49(1), 105–107 (1970)View ArticleMATHGoogle Scholar
 Saito, M., Sturmfels, B., Takayama, N.: Gröbner Deformations of Hypergeometric Differential Equations, Algorithms and Computation in Mathematics, vol. 6. Springer, Berlin (2000)View ArticleMATHGoogle Scholar
 Sontag, E.D.: A technique for determining the signs of sensitivities of steady states in chemical reaction networks. IET Syst. Biol. 8(6), 251–267 (2014)View ArticleGoogle Scholar