English
Related papers

Related papers: Uniformity for limits of tensors

200 papers

We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal rank lower bounds on $k$-tensors cannot yield non-trivial lower…

Computational Complexity · Computer Science 2019-04-10 Ankit Garg , Visu Makam , Rafael Oliveira , Avi Wigderson

We present a heuristic that suggests that ranks of elliptic curves over the rationals are bounded. In fact, it suggests that there are only finitely many elliptic curves of rank greater than 21. Our heuristic is based on modeling the ranks…

Number Theory · Mathematics 2018-07-11 Jennifer Park , Bjorn Poonen , John Voight , Melanie Matchett Wood

The tensor rank of a tensor t is the smallest number r such that t can be decomposed as a sum of r simple tensors. Let s be a k-tensor and let t be an l-tensor. The tensor product of s and t is a (k + l)-tensor. Tensor rank is…

Commutative Algebra · Mathematics 2022-09-30 Matthias Christandl , Asger Kjærulff Jensen , Jeroen Zuiddam

A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two…

Combinatorics · Mathematics 2020-05-19 Oliver Janzer

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

K-Theory and Homology · Mathematics 2017-05-24 Süleyman Kağan Samurkaş

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. These capture any algorithm based on low border rank tensor decompositions, such as $O(n^{\omega+\epsilon})$ time matrix multiplication, and in…

Computational Complexity · Computer Science 2018-11-16 Per Austrin , Petteri Kaski , Kaie Kubjas

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

Number Theory · Mathematics 2025-02-12 Aaron Manning , Alina Ostafe , Igor E. Shparlinski

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

Group Theory · Mathematics 2019-05-14 A. S. Detinko , D. L. Flannery , E. A. O'Brien

The notion of denominator vectors can be extended to all generic basis elements of upper cluster algebras in a natural way. Under a weakened version of generic pairing assumption, we provide a representation-theoretic interpretation for…

Representation Theory · Mathematics 2025-06-05 Jiarui Fei

We address the problem of the additivity of the tensor rank. That is for two independent tensors we study if the rank of their direct sum is equal to the sum of their individual ranks. A positive answer to this problem was previously known…

Algebraic Geometry · Mathematics 2019-08-06 Jarosław Buczyński , Elisa Postinghel , Filip Rupniewski

In this paper, we consider the rank-one tensor completion problem. We address the question of existence and uniqueness of the rank-one solution. In particular we show that the global uniqueness over the field of real numbers can be verified…

Numerical Analysis · Mathematics 2020-09-23 Mohit Singh , Alexander Shapiro , Rui Zhang

Low-rank tensor approximations have shown great potential for uncertainty quantification in high dimensions, for example, to build surrogate models that can be used to speed up large-scale inference problems (Eigel et al., Inverse Problems…

Numerical Analysis · Mathematics 2020-11-30 Paul B. Rohrbach , Sergey Dolgov , Lars Grasedyck , Robert Scheichl

It is shown how a selection of prominent results in singularity theory and differential geometry can be deduced from one theorem, the Rank Theorem for maps between spaces of power series.

Algebraic Geometry · Mathematics 2010-06-29 Clemens Bruschek , Herwig Hauser

We present an $O^*\left(|\mathbb{F}|^{(R-n_*)\left(\sum_d n_d\right)+n_*}\right)$-time algorithm for determining whether a tensor of shape $n_0\times\dots\times n_{D-1}$ over a finite field $\mathbb{F}$ has rank $\le R$, where $n_*:=\max_d…

Computational Complexity · Computer Science 2024-11-25 Jason Yang

We generalise surface cluster algebras to the case of infinite surfaces where the surface contains finitely many accumulation points of boundary marked points. To connect different triangulations of an infinite surface, we consider infinite…

Geometric Topology · Mathematics 2018-12-13 Ilke Canakci , Anna Felikson

The analytic rank of a tensor, first defined by Gowers and Wolf in the context of higher-order Fourier analysis, is defined to be the logarithm of the bias of the tensor. We prove that it is a subadditive measure of rank: that is, the…

Combinatorics · Mathematics 2019-06-04 Shachar Lovett

Let $G_1, \dots, G_k$ be vector spaces over a finite field $\mathbb{F} = \mathbb{F}_q$ with a non-trivial additive character $\chi$. The analytic rank of a multilinear form $\alpha \colon G_1 \times \dots \times G_k \to \mathbb{F}$ is…

Combinatorics · Mathematics 2019-04-25 Luka Milićević

Let $\mathscr{L}$ denote the $\mathbf{Q}$-vector space of logarithms of algebraic numbers. In this expository work, we provide an introduction to the study of ranks of matrices with coefficients in $\mathscr{L}$. We begin by considering a…

Number Theory · Mathematics 2024-01-03 Samit Dasgupta

There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank…

Numerical Analysis · Mathematics 2022-08-17 Jiawang Nie , Li Wang , Zequn Zheng