Related papers: Quadratic exchange equations for Coxeter matroids
We consider the tropicalization of tangent lines to a complete intersection curve $X$ in $\mathbb{P}^n$. Under mild hypotheses, we describe a procedure for computing the tropicalization of the image of the Gauss map of $X$ in terms of the…
We show that tropicalization of linear series on curves gives rise to two-parameter families of tilings by polymatroids, with one parameter arising from the theory of divisors on tropical curves and the other from the reduction of linear…
We relate some features of Bruhat-Tits buildings and their compactifications to tropical geometry. If G is a semisimple group over a suitable non-Archimedean field, the stabilizers of points in the Bruhat-Tits building of G and in some of…
Given a family of parameterized algebraic curves over a strictly semistable pair, we show that the simultaneous tropicalization of the curves in the family forms a family of parameterized tropical curves over the skeleton of the strictly…
We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a…
The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…
If (Q,A) is a marked polygon with one interior point, then a general polynomial f in K[x,y] with support A defines an elliptic curve C on the toric surface X_A. If K has a non-archimedean valuation into the real numbers we can tropicalize C…
We give an overview of recently implemented polymake features for computations in tropical geometry. The main focus is on explicit examples rather than technical explanations. Our computations employ tropical hypersurfaces, moduli of…
White's conjecture asserts that any two tuples of matroid bases that have the same multi-set union can be transformed from one to another by symmetric exchanges; it also implies that the toric ideals of matroids are generated by the…
We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…
Tropical Newton-Puiseux polynomials defined as piece-wise linear functions with rational coefficients at the variables, play a role of tropical algebraic functions. We provide explicit formulas for tropical Newton-Puiseux polynomials being…
We initiate the study of positive-tropical generators as positive analogues of the concept of tropical bases. Applying this to the tropicalization of determinantal varieties, we develop criteria for characterizing their positive part. We…
Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph homomorphism numbers, and in particular, many ask to certify pure binomial inequalities. For a fixed collection of graphs…
For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, \pi), where Q is a word in the alphabet of simple reflections, $\pi$ is a group element. We discuss the transformations of such a complex…
An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
The purpose of this article is to develop foundational techniques from logarithmic geometry in order to define a functorial tropicalization map for fine and saturated logarithmic schemes in the case of constant coefficients. Our approach…
We present a new perspective on the Schottky problem that links numerical computing with tropical geometry. The task is to decide whether a symmetric matrix defines a Jacobian, and, if so, to compute the curve and its canonical embedding.…
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…
Sparse polynomial systems with vertical coefficient dependencies arise naturally when describing the critical points of optimization problems and, when augmented with linear forms, the steady states of chemical reaction networks. Moreover,…