Related papers: Uniformity for limits of tensors

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

We prove that the set of `low rank' points on sufficiently large fibre powers of families of curves are not Zariski dense. The recent work of Dimitrov-Gao-Habegger and K\"uhne (and Yuan) imply the existence of a bound which is exponential…

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…

For a variety over certain topological rings $R$, like $\mathbb{Z}_p$ or $\mathbb{C}$, there is a well-studied way to topologize the $R$-points on the variety. In this paper, we generalize this definition to algebraic stacks. For an…

We determine normal forms and ranks of tensors of border rank at most three. We present a differential-geometric analysis of limits of secant planes in a more general context. In particular there are at most four types of points on limiting…

We provide formulas for the degrees of the projections of the locus of square matrices with given rank from linear spaces spanned by a choice of matrix entries. The motivation for these computations stem from applications to `matrix…

Hankel tensors are generalizations of Hankel matrices. This article studies the relations among various ranks of Hankel tensors. We give an algorithm that can compute the Vandermonde ranks and decompositions for all Hankel tensors. For a…

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

The $X$-rank of a point $p$ in projective space is the minimal number of points of an algebraic variety $X$ whose linear span contains $p$. This notion is naturally submultiplicative under tensor product. We study geometric conditions that…

Learning to rank is a supervised learning problem where the output space is the space of rankings but the supervision space is the space of relevance scores. We make theoretical contributions to the learning to rank problem both in the…

This paper studies the stability of tensor ranks under field extensions. Our main contributions are fourfold: (1) We prove that the analytic rank is stable under field extensions. (2) We establish the equivalence between the partition rank…

Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…

A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…

Let $A$ be a unital locally matrix algebra. Among the examples of such algebras are: (1) an infinite tensor product $\otimes M_{n_i}(\mathbb{F})$ of matrix algebras over a field $\mathbb{F}$, and (2) the Clifford algebra of a nondegenerate…

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…

We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…

Determinantal methods for bounding the rank and border rank of tensors or polynomials are subject to a major barrier. For instance, it is known that using determinantal methods one cannot prove a lower bound for the border rank of a 3-way…

Arithmetic complexity is considered simpler to understand than Boolean complexity, namely computing Boolean functions via logical gates. And indeed, we seem to have significantly more lower bound techniques and results in arithmetic…

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…

The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…