Related papers: Kapranov rank vs. tropical rank

This paper proves the $r \times r$ minors of an $n \times n$ symmetric matrix of indeterminates are a tropical basis when $r = 2$, $r = 3$, or $r = n$, and are not when $4 < r < n$ or $r = 4, n > 12$. In the process, it introduces two new…

We prove that, for any g greater or equal than 3, a matrix g x 5 with tropical rank 3 has Kapranov rank 3.

We continue to study the rank functions of tropical matrices. In this paper, we explain how to reduce the computation of ranks for matrices over the `supertropical semifield' to the standard tropical case. Using a counting approach, we…

In this paper we further develop the theory of matrices over the extended tropical semiring. Introducing a notion of tropical linear dependence allows for a natural definition of matrix rank in a sense that coincides with the notions of…

A tropical matrix is a matrix defined over the max-plus semiring. For such matrices, there exist several non-coinciding notions of rank: the row rank, the column rank, the Schein/Barvinok rank, the Kapranov rank, or the tropical rank, among…

In this note, we generalize the technique developed in [13] and prove that every 5xn matrix of tropical rank at most 3 has Kapranov rank at most 3, for the ground field that contains at least 4 elements. For the ground field either F_2 or…

This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring. We introduce and compare three natural definitions of the rank of a matrix, called the Barvinok rank, the Kapranov rank and the…

We provide an example of a 6-by-6 matrix with tropical rank equal to 4 and Kapranov rank equal to 5. This answers a question asked by M. Chan, A. Jensen, and E. Rubei.

The tropical rank of a semimodule of rational functions on a metric graph mirrors the concept of rank in linear algebra. Defined in terms of the maximal number of tropically independent elements within the semimodule, this quantity has…

We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…

We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP-hardness results by H{\aa}stad~\cite{H90}. The hardness proof also implies an…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…

We show that Lang's conjecture on error terms in Diophantine approximation implies Honda's conjecture on ranks of elliptic curves over number fields. We also show that even a very weak version of Lang's error term conjecture would be enough…

Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…

In this paper we obtain three undecidable results for exponential diophantine equations over the field $\mathbb Q$ of rational numbers. For example, we prove that there is no algorithm to decide the solvability of a general exponential…

We compute the space of 5x5 matrices of tropical rank at most 3 and show that it coincides with the space of 5x5 matrices of Kapranov rank at most 3, that is, the space of five labeled coplanar points in TP4. We then prove that the Kapranov…

We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…

Let D(m,n) be the set of all the integer points in the m-dilate of the Birkhoff polytope of doubly-stochastic n by n matrices. In this paper we find the sharp upper bound on the tropical determinant over the set D(m,n). We define a version…

Weighted automata over the max-plus semiring S are closely related to finitely generated semigroups of matrices over S. In this paper, we use results in automata theory to study two quantities associated with sets of matrices: the joint…

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…