# Detecting tropical defects of polynomial equations

- 63 Downloads

## Abstract

We introduce the notion of tropical defects, certificates that a system of polynomial equations is not a tropical basis, and provide two algorithms for finding them in affine spaces of complementary dimension to the zero set. We use these techniques to solve open problems regarding del Pezzo surfaces of degree 3 and realizability of valuated gaussoids on 4 elements.

## Keywords

Tropical geometry Tropical basis Computer algebra## Mathematics Subject Classification

14T04 13P10 68W30## 1 Introduction

The *tropical variety*\({{\,\mathrm{Trop}\,}}(I)\) of a polynomial ideal *I* is the image of its algebraic variety under component-wise valuation. Tropical varieties are commonly described as combinatorial shadows of their algebraic counterparts and arise naturally in many applications throughout mathematics and beyond. Inside mathematics for example, they enable new insights into important invariants in algebraic geometry [23] or the complexity of central algorithms in linear optimization [1]. Outside mathematics, they arise as spaces of phylogenetic trees in biology [25, 29], loci of indifference prizes in economics [3, 31] or in the proof of the finiteness of central configurations in the 4, 5-body problem in physics [10, 11].

*tropical prevariety*and, if equality holds,

*F*a

*tropical basis*. This question is important for two main reasons. On the one hand, tropical prevarieties can provide upper dimension bounds where Gröbner bases are infeasible to compute, see [10, 11], and a tropical basis implies that this bound is actually sharp. On the other hand, the difference between a tropical variety and prevariety can be interesting in and of itself, e.g., tropical matrices of Kapranov rank

*r*versus tropical matrices of tropical rank

*r*[9], tropical Grassmannians versus their Dressians [14], or other realizability loci of combinatorial objects such as \(\Delta \)-matroids [28] or gaussoids [5].

Nevertheless, checking the equality in (\(*\)) is a computationally highly challenging task. Current algorithms for computing tropical varieties require a Gröbner basis for each maximal Gröbner polyhedron, of which there can be many even for tropicalization of linear spaces [19]. Additionally, it is known that deciding the equality in (\(*\)) is co-NP-hard, as is merely deciding whether \({{\,\mathrm{Trop}\,}}(F)\) is connected [30].

- (P1)
Computing \({{\,\mathrm{Trop}\,}}(F)\) might not be possible due to its size or due to the number of intersections necessary to compute it.

- (P2)
Computing \({{\,\mathrm{Trop}\,}}(I)\) might not be feasible due to its size or due to problematic Gröbner cones in \({{\,\mathrm{Trop}\,}}(I)\) whose Gröbner bases are too hard to compute.

*tropical defects*, certificates for generating sets which are not tropical bases, and propose two randomized algorithms for computing tropical defects around affine subspaces of complementary dimension. An independent verification of these certificates will require a single Gröbner basis computation.

- (K1)
- (K2)
computation of zero-dimensional tropical prevarieties in DynamicPrevariety [17].

In Sects. 3 and 4, we present two tropical defects found using out algorithm, disproving Conjecture 5.3 in [27] and Conjecture 8.4 in [5]. Note that the tropical defects were postprocessed for the ease of reproduction; see Remark 2.8. Code and auxiliary materials for this article are available at software.mis.mpg.de. More information on gaussoids can be found at gaussoids.de.

## 2 Tropical defects

In this section, we introduce the notion of tropical defects for generating sets of polynomial ideals, and two algorithms to find them around generic affine spaces \(L={{\,\mathrm{Trop}\,}}(H)\) of complementary dimension. To be precise, Algorithm 2.9 requires a generic tropicalization *L*, whereas Algorithm 2.13 merely requires a generic realization *H*.

We begin by briefly recalling some basic notions of tropical geometry that are of immediate relevance to us. Our notation coincides with that of [21], to which we refer for a more in-depth introduction of the subject.

### Convention 2.1

For the remainder of this article, fix an algebraically closed field *K* with valuation \(\nu :K^*\rightarrow \mathbb {R}\) and residue field \(\mathfrak K\) with trivial valuation. Since *K* is algebraically closed, there is a group homomorphism \(\mu :\nu (K^*)\rightarrow K^*\) such that \(\nu \circ \mu ={{\,\mathrm{id}\,}}_{\nu (K^*)}\), and we abbreviate \(t^{\lambda }:=\mu (\lambda )\) for \(\lambda \in \nu (K^*)\). Moreover, we fix a multivariate (Laurent) polynomial ring \(K[x^{\pm 1}]:=K[x_1^{\pm 1},\ldots ,x_n^{\pm 1}]\).

### Definition 2.2

*Initial forms, initial ideals*) Given a polynomial \(f\in K[x^{\pm 1}]\), say \(f=\sum _{\alpha \in \mathbb {Z}^n} c_{\alpha }\cdot x^{\alpha }\), its

*initial form*with respect to a weight vector \(w\in \mathbb {R}^n\) is

*Gröbner polyhedron*of

*f*, of

*I*or of a finite set \(F\subseteq K[x^{\pm 1}]\) around

*w*is defined asNote that both \(C_w(f)\) and \(C_w(F)\) are in fact convex polyhedra, while \(C_w(I)\) is only guaranteed to be a convex polyhedron if

*I*is homogeneous.

### Definition 2.3

*Tropical variety, tropical prevariety*) Given a polynomial \(f\in K[x^{\pm 1}]\), an ideal \(I\unlhd K[x^{\pm 1}]\) and a finite set \(F\subseteq K[x^{\pm 1}]\), the

*tropical varieties*of

*f*and

*I*and the

*tropical prevariety*of

*F*are defined to be

*tropical basis*if

*I*is homogeneous, so can \({{\,\mathrm{Trop}\,}}(I)\).

*star*of

*T*around a point \(w\in \mathbb {R}^{n}\) is given by

*stable intersection*of

*T*with respect to an affine subspace \(H\subseteq \mathbb {R}^n\) is defined to be

### Example 2.4

*I*, showing that \(F_2\) is a tropical basis while \(F_1\) is not.

For the following result, we refer to [21], where it is only shown for polynomial rings. However, the result extends directly to Laurent polynomial rings, since \({{{\,\mathrm{in}\,}}_w(I \cap K[x]) \cdot K[x^{\pm 1}] = {{\,\mathrm{in}\,}}_w(I)}\) for all \(I \unlhd K[x^{\pm 1}]\).

### Lemma 2.5

We will now introduce the notion of a tropical defect and two algorithms for finding them around affine spaces of complementary dimension. For the sake of simplicity, we restrict ourselves to affine spaces in direction of the last few coordinates; see Example 2.10 for general affine spaces.

### Definition 2.6

*Tropical defects*) Let \(I\unlhd K[x^{\pm 1}]\) be a polynomial ideal with finite generating set \(F\subseteq I\). We call a finite tuple \(\mathbf {w}:=(w_0,\dots ,w_k) \in (\mathbb {R}^n)^{k+1}\) a

*tropical defect*if for all \(\varepsilon > 0\) sufficiently small we have

### Example 2.7

For \(I=\langle F_1\rangle \) from Example 2.4, the tuple (*w*, *v*) with \(w:=(0,1)\) and \(v:=(0,1)\) is a tropical defect, while the singleton (*w*) is not. On the other hand, the singleton (*u*) with \(u:=(0,2)\) is a tropical defect, see Fig. 2.

### Remark 2.8

(Singleton tropical defects) Note that any tropical defect \((w_0,\ldots ,w_k)\) of a homogeneous ideal can be transformed into a singleton tropical defect *u* through a single (tropical) Gröbner basis [6] or standard basis computation [22]:

One can simulate the weight vector \(w_\varepsilon :=w_0 + \varepsilon w_1 + \dots + \varepsilon ^{k} w_k\) for \(\varepsilon >0\) sufficiently small through a sequence of weights as in Lemma 2.5. In particular, we can compute a Gröbner basis with respect to the sequence of weights, which gives us the inequalities and equations of the Gröbner cone \(C_{w_\varepsilon }(I)\) by [21, proof of Prop. 2.5.2]. Any \(u\in {{\,\mathrm{Relint}\,}}C_{w_\varepsilon }(I)\) is a singleton tropical defect.

For the ease of verification, the tropical defects in Sects. 3 and 4 have been transformed into singletons.

Algorithm 2.9 checks for tropical defects around affine subspaces which satisfy a strong genericity assumption.

### Algorithm 2.9

*Correctness of Algorithm*2.9. Note that (SG) implies that \({{\,\mathrm{Trop}\,}}(I) \cap H\) is at most zero-dimensional, since

*H*is of complementary dimension to \({{\,\mathrm{Trop}\,}}(I)\) and by [21, Theorem 3.6.10], while (\(*\)) ensures that it is not empty. By [24, Theorem 1.1], we therefore have

*w*is a tropical defect since

### Example 2.10

*F*of the following one-dimensional ideal:

*x*-coordinate. Figure 3 shows the tropical variety \({{\,\mathrm{Trop}\,}}(I)\) and the tropical prevariety \({{\,\mathrm{Trop}\,}}(F)\).

### Example 2.11

*F*of the following one-dimensional ideal:

*x*-coordinate. Figure 4 shows \({{\,\mathrm{Trop}\,}}(I)\) as well as \({{\,\mathrm{Trop}\,}}(F)\). Consider the plane \(H_v:=\pi ^{-1}(v)\) for some \(v\in \mathbb {R}\). Note that while any \(H_v\) with \(v\ne 0\) satisfies (SG), only \(H_v\) with \(v>0\) yields a tropical defect in Algorithm 2.9, Line 5.

### Remark 2.12

One possibility to ascertain whether (SG) holds upon termination at Line 5 is to compute the Gröbner polyhedron \(C_w(I)\), if *I* is homogeneous. However, that requires a tropical Gröbner basis or standard basis, and hence might not be viable for large examples.

In practice, affine subspaces satisfying the strong genericity assumption induce several problems; see Remark 2.16. This is why we introduce Algorithm 2.13, which relies on a weakened genericity assumption. Note that, compared to Algorithm 2.9, Algorithm 2.13 requires the computation of \({{\,\mathrm{Trop}\,}}({{\,\mathrm{in}\,}}_w(F))\) for some \(w\in {{\,\mathrm{Trop}\,}}(F)\cap H\) at Line 5. This is unproblematic, however, since \({{\,\mathrm{in}\,}}_w(f)\) has fewer terms than *f* for all \(f\in F\), so that \({{\,\mathrm{Trop}\,}}({{\,\mathrm{in}\,}}_w(f))\) will be simpler than \({{\,\mathrm{Trop}\,}}(f)\). In fact, generically \({{\,\mathrm{in}\,}}_w(f)\) will be a binomial and \({{\,\mathrm{Trop}\,}}({{\,\mathrm{in}\,}}_w(f))\) a linear space.

### Algorithm 2.13

### Correctness of Algorithm 2.13

Suppose the algorithm terminates at Line 8. By Lemma 2.5, there exists \(\delta >0\) such that \(D:=\{w+\varepsilon u+\varepsilon ^2 v_1+\dots +\varepsilon ^{k+1} v_k\mid 0<\varepsilon <\delta \}\subseteq {{\,\mathrm{Trop}\,}}(F)\). Because any infinite subset of *D* has affine span \(w+{{\,\mathrm{Span}\,}}(C_u({{\,\mathrm{in}\,}}_w F))\) of dimension \(k>d=\dim {{\,\mathrm{Trop}\,}}(I)\), any polyhedron on \({{\,\mathrm{Trop}\,}}(I)\) will have a finite intersection with *D*. In particular, this implies that \(w+\varepsilon u+\varepsilon ^2 v_1+\dots +\varepsilon ^{k+1} v_k\notin {{\,\mathrm{Trop}\,}}(I)\) for \(\varepsilon >0\) sufficiently small.

Suppose the algorithm terminates at Line 14. Again, by Lemma 2.5, there exists \(\delta >0\) such that \(D:=\{w+\varepsilon u+\varepsilon ^2 v_1+\dots +\varepsilon ^{d+1} v_d\mid 0<\varepsilon <\delta \}\subseteq {{\,\mathrm{Trop}\,}}(F)\). Any infinite subset of *D* has affine span \(w+{{\,\mathrm{Span}\,}}(C_u({{\,\mathrm{in}\,}}_w F))\), which intersects *H* stably. We have \(w\notin {{\,\mathrm{Trop}\,}}(I')={{\,\mathrm{Trop}\,}}(I)\cap _{{{\,\mathrm{st}\,}}}H\) by assumption (WG), so any polyhedron on \({{\,\mathrm{Trop}\,}}(I)\) around *w* can only have a finite intersection with *D*. In particular, this implies that \(w+\varepsilon u+\varepsilon ^2 v_1+\dots +\varepsilon ^{k+1} v_k\notin {{\,\mathrm{Trop}\,}}(I)\) for \(\varepsilon >0\) sufficiently small.

Finally, suppose the algorithm terminates at Line 16. Since \({{\,\mathrm{Trop}\,}}(F)\supseteq {{\,\mathrm{Trop}\,}}(I)\), we always have \({{\,\mathrm{Trop}\,}}(F)\cap _{{{\,\mathrm{st}\,}}} H\supseteq {{\,\mathrm{Trop}\,}}(I)\cap _{{{\,\mathrm{st}\,}}} H\). For the converse, assume there exists a weight \(w\in {{\,\mathrm{Trop}\,}}(F)\cap _{{{\,\mathrm{st}\,}}} H \setminus {{\,\mathrm{Trop}\,}}(I)\cap _{{{\,\mathrm{st}\,}}} H\). Let \(C_{u}(F)\subseteq {{\,\mathrm{Trop}\,}}(F)\) be a Gröbner polyhedron of the prevariety with \(w\in C_{u}(F)\cap H\) and \(\dim (C_{u}(F) + H)=n\), which necessarily implies \(\dim C_{u}(F)\ge d\). If \(\dim C_{u}(F)>d\), then \(\dim C_u({{\,\mathrm{in}\,}}_w(F))>d\) and we would have terminated at Line 8. If \(\dim C_{u}(F)=d\), then *w* appears as the first entry of some tuple in \(\Delta \) by Lemma 2.5 and Lines 9 to 11; hence, we would have terminated at Line 14, as \({{\,\mathrm{Trop}\,}}(I')={{\,\mathrm{Trop}\,}}(I)\cap _{{{\,\mathrm{st}\,}}} H\) by assumption (WG). \(\square \)

### Remark 2.14

(Weak genericity) If Algorithm 2.13 terminates at Line 8, then the output is correct even if the input did not satisfy the weak genericity assumption (WG), since a polyhedron in \({{\,\mathrm{Trop}\,}}(F)\) of too large dimension was found. On the other hand, the correctness of a tropical defect output at Step 14 does depend on the assumption (WG) on the input. In order to certify the correctness of the output regardless of the validity of (WG), one needs to check that there is no sufficiently small \(\varepsilon > 0\) such that \(w+\varepsilon u + \varepsilon ^2 v_1+\cdots +\varepsilon ^{d+1} v_d \in {{\,\mathrm{Trop}\,}}I\). If *I* is homogeneous, this can by Lemma 2.5 be achieved by certifying that the iterated initial ideal \({{\,\mathrm{in}\,}}_{v_d} \cdots {{\,\mathrm{in}\,}}_{v_1} {{\,\mathrm{in}\,}}_u {{\,\mathrm{in}\,}}_w I\) is the entire Laurent polynomial ring \(\mathfrak {K}[x^{\pm 1}]\).

### Example 2.15

However, Algorithm 2.13 will still find a tropical defect for \(L_v\) for \(v\ne 0\), in which case it terminates at Line 14.

### Remark 2.16

(Strong genericity vs. weak genericity from a practical point of view) Theoretically, it is always possible to find tropical defects for generating sets which are not tropical bases using Algorithm 2.9 with the right choice of an affine subspace. In practice, however, it is much more reasonable to use Algorithm 2.13 instead. This is because generic \(v\in \mathbb {R}^d\) for Algorithm 2.9 usually entail high exponents in the polynomial computations, whereas generic \(\lambda \in (K^*)^d\) for Algorithm 2.13 only entail big coefficients, and most computer algebra software systems such as Macaulay2 or Singular are better equipped to deal with the latter. For instance, our Singular experiments using Algorithm 2.9 regularly failed due to exponent overflows, since exponents in Singular are stored in the Open image in new window type signed short (bounded by \(2^{15}\) for most CPU architectures), while coefficients are stored with arbitrary precision.

### Remark 2.17

(Comparison with existing techniques) As hinted in the introduction, tropical basis verification is a problem that has been studied by many people. However, the only software currently capable of this task is gfan [16], which, for example, has been used to prove that the \(4\,\times \, 4\)-minors of a \(5\,\times \, n\) matrix form a tropical basis [7]. Its command gfan_tropicalbasis computes a tropical basis, and its command gfan_tropicalintersection for computing tropical prevarieties \({{\,\mathrm{Trop}\,}}(F)\) has an optional argument –tropicalbasistest to test whether \({{\,\mathrm{Trop}\,}}(F)\) equals the tropical variety \({{\,\mathrm{Trop}\,}}(I)\). Compared to the algorithms in gfan, our techniques have the following disadvantages and advantages.

Since our algorithms revolve around finding tropical defects, they are incapable to verify that a generating set is a tropical basis. As we only search around random hyperplanes of complementary dimension, we are also blind to lower-dimensional defects, i.e., if \(\dim ({{\,\mathrm{Trop}\,}}(I)\setminus {{\,\mathrm{Trop}\,}}(F))<\dim ({{\,\mathrm{Trop}\,}}(I))=:d\), then the probability for a random affine hyperplane of codimension *d* to intersect \({{\,\mathrm{Trop}\,}}(I)\setminus {{\,\mathrm{Trop}\,}}(F)\) is zero. One example where our algorithms failed to return a definite answer is [28, Conjecture 4.8].

In return, our algorithms avoid the computation of both \({{\,\mathrm{Trop}\,}}(F)\) and \({{\,\mathrm{Trop}\,}}(I)\). Instead of \({{\,\mathrm{Trop}\,}}(F)=\bigcap _{f\in F}{{\,\mathrm{Trop}\,}}(f)\), we compute \({{\,\mathrm{Trop}\,}}(F')=\bigcap _{f\in F} ({{\,\mathrm{Trop}\,}}(f)\cap H)\). This is faster, since \({{\,\mathrm{Trop}\,}}(f)\cap H\) is covered by fewer polyhedra compared to \({{\,\mathrm{Trop}\,}}(f)\). Moreover, instead of \({{\,\mathrm{Trop}\,}}(I)\) we compute \({{\,\mathrm{Trop}\,}}(I')\), where \(I':= I+\langle x_i\!-\!\lambda _i\mid i=1,\dots ,d\rangle \). This is easier since \(I'\) is zero-dimensional whereas *I* is not. Additionally, \({{\,\mathrm{Trop}\,}}(I')\) consists of up to \(\deg (I)\) many points, while \({{\,\mathrm{Trop}\,}}(I)\) is generally covered by many more polyhedra.

## 3 Application: Cox rings of cubic surfaces

Cox rings are global invariants of important classes of algebraic varieties. For example, they carry essential information about all morphisms to projective spaces and play a central role in the theory of universal torsors; see [2] for further details. In this section, we address [27, Conjecture 5.3] on Cox rings of smooth cubic surfaces, disproving it with a tropical defect.

### Definition 3.1

*Cox ring*

\(E_1, \ldots , E_6 \subseteq X\) are the exceptional divisors over the points \(p_1, \ldots , p_6 \in \mathbb {P}_\mathbb {C}^2\),

\(E_0 \subseteq X\) is the preimage of a line in \(\mathbb {P}_\mathbb {C}^2\) not containing \(p_1, \ldots , p_6\), and

\(H^0(X, \mathcal {O}_X(a_0 E_0 + a_1 E_1 + \ldots + a_6 E_6)) \subseteq K(X)\) are the rational functions on

*X*which vanish along each \(E_i\) with multiplicity at least \(-a_i\) (vanishing with negative multiplicity meaning poles of positive order).

For a smooth cubic surface *X*, the Cox ring \({{\,\mathrm{Cox}\,}}(X)\) is a finitely generated integral domain with a natural set of 27 generators which are the rational functions on *X* establishing the linear equivalence of each of the 27 lines on the cubic surface *X* to a divisor of form \(\sum _i a_i E_i \in {{\,\mathrm{Div}\,}}(X)\); see [4, Theorem 3.2].

### Proposition 3.2

*X*be the cubic surface that is the blowup of \((1:d_i:d_i^3)\in \mathbb {P}_\mathbb {C}^2\). Then,where, up to saturation at the product of all variables, \(I_X\) is generated by the following 10 trinomials and their 260 translates under the action of the Weyl group of type \(\mathbf {E}_6\):

\(E_i\) represents the exceptional divisor over the point \(p_i\),

\(F_{ij}\) represents the strict transform of the line through \(p_i\) and \(p_j\),

\(G_i\) represents the strict transform of the conic through \(\{p_1,\ldots ,p_6\} \setminus \{p_i\}\).

The following theorem answers [27, Conjecture 5.3] negatively:

### Theorem 3.3

For generic \(d_1,\ldots ,d_6 \in \mathbb {C}\), the 270 trinomial generators of \(I_X\) described in Proposition 3.2 are not a tropical basis.

### Proof

*w*is a tropical defect, i.e.,

*w*lies in the tropical prevariety, since \({{\,\mathrm{in}\,}}_w(f)\) is at least binomial for each trinomial generator

*f*, and outside the tropical variety, since \({{\,\mathrm{in}\,}}_w(I_X)\) contains the monomial \(E_6F_{56}G_6\). \(\square \)

### Remark 3.4

## 4 Application: realizability of valuated gaussoids

Gaussoids are combinatorial structures introduced by Lněnička and Matúš [20] that encode conditional independence relations among Gaussian random variables. Reminiscent of the study of matroids, Boege et al. [5] introduced the notions of oriented and valuated gaussoids. In this section, we address the question whether all valuated gaussoids on four elements are realizable, disproving it with a tropical defect. This was initially conjectured in the first version of [5], as found on arXiv. The published version has since been updated with our Theorem 4.3.

### Definition 4.1

*valuated gaussoid*is a point in the tropical prevariety defined by the square and edge trinomials. It is called

*realizable*if it lies in the tropical variety \({{\,\mathrm{Trop}\,}}(T_n)\).

### Remark 4.2

The variables of the ring *R* correspond to the principal and almost-principal minors of a symmetric \(n \times n\)-matrix (i.e., determinants of square submatrices whose row and column index sets differ by at most one index). The ideal \(T_n\) corresponds to the polynomial relations among these minors for symmetric matrices with nonzero principal minors by [5, Proposition 6.2].

The following theorem negatively answers Conjecture 8.4 in the first arXiv-version of [5], and is now Theorem 8.4 in the final published version of [5]:

### Theorem 4.3

Not all valuated gaussoids on four elements are realizable, i.e., the square and edge trinomials in Definition 4.1 are not a tropical basis of \(T_4\).

### Proof

*S*of the variables of \(R_4\) and weight vector \(w\in \mathbb {R}^S\):

*w*is a tropical defect, i.e.,

*w*lies in the tropical prevariety, since \({{\,\mathrm{in}\,}}_w(f)\) is at least binomial for all square and edge trinomials, and outside the tropical variety, since \({{\,\mathrm{in}\,}}_w(T_4)\) contains the monomial \(a_{23}a_{23|1}\). \(\square \)

### Remark 4.4

### Remark 4.5

(sampling affine subspaces for tropical defects) The tropical defects in Theorems 3.3 and 4.3 were found by repeatedly running Algorithm 2.13 on random affine subspaces \(H\subseteq \mathbb {R}^n\). In the sampling of the affine subspaces, a situation which we tried to avoid are two subspaces intersecting the tropical variety in exactly the same Gröbner polyhedra. In the following, we describe our sampling approach which we based on this thought.

- (1)
a Gröbner basis of

*I*with respect to a graded reverse lexicographical ordering, - (2)
for selected finite fields \(\mathbb {F}\) and \(d+1:=\dim (I)+1\) variables \(x_{i_0},\dots ,x_{i_d}\), the generator \({\overline{g}}\in \mathbb {F}[x_{i_0},\dots ,x_{i_d}]\) of the principal elimination ideal \((I\otimes _{\mathbb {Z}}\mathbb {F}) \cap \mathbb {F}[x_{i_0},\dots ,x_{i_d}]\).

*g*of principal elimination ideals \(I \cap K[x_{i_0},\dots ,x_{i_d}]\), while (1) allowed for tests whether the guesses were correct. Thus, we were able to compute tropical hypersurfaces \({{\,\mathrm{Trop}\,}}(g)\subseteq \mathbb {R}^{d+1}\) which are the images of \({{\,\mathrm{Trop}\,}}(I)\) under selected orthogonal projections \(\pi :\mathbb {R}^n\rightarrow \mathbb {R}^{d+1}\).

For each projection, we then constructed affine lines \(L_1,\ldots ,L_k\subseteq \mathbb {R}^{d+1}\) such that each maximal polyhedron of \({{\,\mathrm{Trop}\,}}(g)\) intersects at least one line. Their preimages \(\pi ^{-1}L_1,\ldots ,\pi ^{-1}L_k\) are then *d*-codimensional affine subspaces which were our samples for *H*.

## Notes

### Acknowledgements

Open access funding provided by Max Planck Society. The authors would like to thank Bernd Sturmfels for his helpful comments and suggestions. All authors were partially supported by the Institut Mittag-Leffler during the research program “Tropical Geometry, Amoebas and Polytopes”. The authors would like to thank the institute for its hospitality.

## References

- 1.Allamigeon, X., Benchimol, P., Gaubert, S., Joswig, M.: Log-barrier interior point methods are not strongly polynomial. SIAM J. Appl. Algebra Geom.
**2**(1), 140–178 (2018)MathSciNetCrossRefGoogle Scholar - 2.Arzhantsev, I., Derenthal, U., Hausen, J., Laface, A.: Cox Rings. Cambridge Studies in Advanced Mathematics, vol. 144, p. viii+530. Cambridge University Press, Cambridge (2015)zbMATHGoogle Scholar
- 3.Baldwin, E., Klemperer, P.: Understanding preferences: demand types, and the existence of equilibrium with indivisibilities. Econometrica
**87**(3), 867–932 (2019)MathSciNetCrossRefGoogle Scholar - 4.Batyrev, V.V., Popov, O.N.: The Cox ring of a del Pezzo surface. In: Arithmetic of higher-dimensional algebraic varieties (Palo Alto, CA, 2002), vol. 226. Progr. Math. Birkhäuser Boston, Boston, MA, pp. 85–103 (2004)Google Scholar
- 5.Boege, T., D’Alì, A., Kahle, T., Sturmfels, B.: The geometry of gaussoids. Found. Comput. Math.
**19**(4), 775–812 (2019)MathSciNetCrossRefGoogle Scholar - 6.Chan, A.J., Maclagan, D.: Gröbner bases over fields with valuations. Math. Comp.
**88**, 467–483 (2019)MathSciNetCrossRefGoogle Scholar - 7.Chan, M., Jensen, A., Rubei, E.: The \(4 \times 4\) minors of a \(5 \times n\) matrix are a tropical basis. Linear Algebra Appl.
**435**(7), 1598–1611 (2011)MathSciNetCrossRefGoogle Scholar - 8.Decker, W., Greuel, G.-M., Pfister, G., Schönemann, H.: Singular 4-1-2—a computer algebra system for polynomial computations (2019). https://www.singular.uni-kl.de/
- 9.Develin, M., Santos, F., Sturmfels, B.: On the rank of a tropical matrix. In: Combinatorial and Computational Geometry, vol. 52, pp. 213–242. Mathematical Sciences Research Institute Publications, Cambridge University Press, Cambridge (2005)Google Scholar
- 10.Hampton, M., Jensen, A.: Finiteness of spatial central configurations in the five-body problem. Celestial Mech. Dynam. Astronom.
**109**(4), 321–332 (2011)MathSciNetCrossRefGoogle Scholar - 11.Hampton, M., Moeckel, R.: Finiteness of relative equilibria of the four-body problem. Invent. Math.
**163**(2), 289–312 (2006)MathSciNetCrossRefGoogle Scholar - 12.Hept, K., Theobald, T.: Tropical bases by regular projections. Proc. Amer. Math. Soc.
**137**(7), 2233–2241 (2009)MathSciNetCrossRefGoogle Scholar - 13.Hept, K., Theobald, T.: Projections of tropical varieties and their self-intersections. Adv. Geom.
**12**(2), 203–228 (2012)MathSciNetCrossRefGoogle Scholar - 14.Herrmann, S., Joswig, M., Speyer, D.E.: Dressians, tropical Grassmannians, and their rays. Forum Math.
**26**(6), 1853–1881 (2014)MathSciNetCrossRefGoogle Scholar - 15.Hofmann, T., Ren, Y.: Computing tropical points and tropical links. Discrete Comput. Geom.
**60**(3), 627–645 (2018)MathSciNetCrossRefGoogle Scholar - 16.Jensen, A.N.: Gfan 0.6.2, a software system for Gröbner fans and tropical varieties (2017). http://www.math.tu-berlin.de/~jensen/software/gfan/gfan.html
- 17.Jensen, A., Sommars, J., Verschelde, J.: Computing tropical prevarieties in parallel. In: Proceedings of the International Workshop on Parallel Symbolic Computation (PASCO), 9:1–u9:8. ACM, Kaiserslautern, Germany (2017)Google Scholar
- 18.Jensen, A., Yu, J.: Stable intersections of tropical varieties. J. Algebraic Combin.
**43**(1), 101–128 (2016)MathSciNetCrossRefGoogle Scholar - 19.Joswig, M., Schröter, B.: The degree of a tropical basis. Proc. Amer. Math. Soc.
**146**(3), 961–970 (2018)MathSciNetCrossRefGoogle Scholar - 20.Lněnička, R., Matúš, F.: On Gaussian conditional independent structures. Kybernetika (Prague)
**43**(3), 327–342 (2007)MathSciNetzbMATHGoogle Scholar - 21.Maclagan, D., Sturmfels, B.: Introduction to Tropical Geometry. Graduate Studies in Mathematics, vol. 161, p. xii+363. American Mathematical Society, Providence (2015)CrossRefGoogle Scholar
- 22.Markwig, T., Ren, Y.: Computing tropical varieties over fields with valuation. eprint: arXiv:1612.01762
- 23.Mikhalkin, G.: Enumerative tropical algebraic geometry in \(\mathbb{R}^2\). J. Amer. Math. Soc.
**18**(2), 313–377 (2005)MathSciNetCrossRefGoogle Scholar - 24.Osserman, B., Payne, S.: Lifting tropical intersections. Doc. Math.
**18**, 121–175 (2013)MathSciNetzbMATHGoogle Scholar - 25.Pachter, L., Sturmfels, B.: Algebraic Statistics for Computational Biology. Cambridge University Press, New York (2005)CrossRefGoogle Scholar
- 26.Ren, Q., Sam, S.V., Sturmfels, B.: Tropicalization of classical moduli spaces. Math. Comput. Sci.
**8**(2), 119–145 (2014)MathSciNetCrossRefGoogle Scholar - 27.Ren, Q., Shaw, K., Sturmfels, B.: Tropicalization of del Pezzo surfaces. Adv. Math.
**300**, 156–189 (2016)MathSciNetCrossRefGoogle Scholar - 28.Rincón, F.: Isotropical linear spaces and valuated Delta-matroids. J. Combin. Theory Ser. A
**119**(1), 14–32 (2012)MathSciNetCrossRefGoogle Scholar - 29.Speyer, D., Sturmfels, B.: The tropical Grassmannian. Adv. Geom.
**4**(3), 389–411 (2004)MathSciNetCrossRefGoogle Scholar - 30.Theobald, T.: On the frontiers of polynomial computations in tropical geometry. J. Symbolic Comput.
**41**(12), 1360–1375 (2006)MathSciNetCrossRefGoogle Scholar - 31.Tran, N.M., Yu, J.: Product-mix auctions and tropical geometry. eprint: arXiv:1505.05737

## Copyright information

**Open Access**This 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.