Related papers: Kapranov rank vs. tropical rank

Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…

The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…

In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…

Given a differential or $q$-difference equation $P$ of order $n$, we prove that the set of exponents of a generalized power series solution has its rational rank bounded by the rational rank of the support of $P$ plus $n$. We also prove…

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…

For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…

In this note we give a negative answer to Abraham Robinson's question whether a finitely generated extension of an undecidable field is always undecidable. We construct 'natural' undecidable fields of transcendence degree 1 over Q all of…

We show that the Diophantine problem in Thompson's group F is undecidable. Our proof uses the facts that F has finite commutator width and rank 2 abelianisation, then uses similar arguments used by B\"uchi and Senger and Ciobanu and Garreta…

In the article 'Recursive queries on trees and data trees' (ICDT'13), Abiteboul et al., asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is…

Given a global field $K$ and a positive integer $n$, we present a diophantine criterion for a polynomial in one variable of degree $n$ over $K$ not to have any root in $K$. This strengthens the known result that the set of non-$n$-th-powers…

In this paper, we are going to prove the relation between rank of elliptic curves and the non-triviality of class groups of infinitely many real quadratic fields.

Building on our earlier results on tropical independence and shapes of divisors in tropical linear series, we give a tropical proof of the maximal rank conjecture for quadrics. We also prove a tropical analogue of Max Noether's theorem on…

If $E$ is an elliptic curve defined over a quadratic field $K$, and the $j$-invariant of $E$ is not 0 or 1728, then $E(\mathbf{Q}^{\ab})$ has infinite rank. If $E$ is an elliptic curve in Legendre form, $y^2 = x(x-1)(x-\lambda)$, where…

We show that elliptic curves whose Mordell-Weil groups are finitely generated over some infinite extensions of $\Q$, can be used to show the Diophantine undecidability of the rings of integers and bigger rings contained in some infinite…

We determine the tensor rank of all semifields of order 16 over $\mathbb{F}_2$ and of all semifields of order 81 over $\mathbb{F}_3$. Our results imply that some semifields of order 81 have lower multiplicative complexity than the finite…

We demonstrate that the question whether or not a given postcritically finite topological ramified covering map of the 2-sphere is Thurston equivalent to a rational map is algorithmically decidable.

We study one-variable equations over the lamplighter group $\MZ_2 \wr \MZ$. While the decidability of arbitrary equations over $L_2$ remains open, we prove that the Diophantine problem for single equations in one variable is decidable. Our…

Using elementary linear algebra, we develop a technique that leads to solutions of two widely known problems on nonnegative matrices. First, we give a short proof of the result by Vavasis stating that the nonnegative rank of a matrix is…

Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem…

For any quadratic extension $L/K$ of number fields, we prove that there are infinitely many elliptic curves $E$ over $K$ so that the abelian groups $E(K)$ and $E(L)$ both have rank $1$. In particular, there are infinitely many elliptic…