Related papers: Probabilistic bounds on best rank-one approximatio…
We consider successive measurements of position and momentum of a single particle. Let P be the conditional probability to measure the momentum k with precision dk, given a previously successful position measurement q with precision dq.…
The purpose of this paper is twofold. First, we provide an optimal $\Omega(\sqrt{n})$ bits lower bound for any two-way protocol for the Vector in Subspace Communication Problem which is of bounded total rank. This result complements Raz's…
We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…
Let $\sigma_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times)…
A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…
We establish several mathematical and computational properties of the nuclear norm for higher-order tensors. We show that like tensor rank, tensor nuclear norm is dependent on the choice of base field --- the value of the nuclear norm of a…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
The approximate stabilizer rank of a quantum state is the minimum number of terms in any approximate decomposition of that state into stabilizer states. Bravyi and Gosset showed that the approximate stabilizer rank of a so-called "magic"…
We give an upper bound for the rank of the border rank 3 partially symmetric tensors. In the special case of border rank 3 tensors $T\in V_1\otimes \cdots \otimes V_k$ (Segre case) we can show that all ranks among 3 and $k-1$ arise and if…
The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…
Many special functions are solutions of first order linear systems $y_n'(x)=a_n(x)y_n(x)+d_n(x)y_{n-1}(x)$, $y_{n-1}'(x)=b_n(x)y_{n-1}(x)+e_{n}(x)y_n(x)$. We obtain bounds for the ratios $y_n(x)/y_{n-1}(x)$ and the logarithmic derivatives…
We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…
We obtain new uniform upper bounds for the (non necessarily symmetric) tensor rank of the multiplication in the extensions of the finite fields $\F_q$ for any prime or prime power $q\geq2$; moreover these uniform bounds lead to new…
Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…
The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound…
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…
We present a framework for the theoretical analysis of ensembles of low-complexity empirical risk minimisers trained on independent random compressions of high-dimensional data. First we introduce a general distribution-dependent…
A symmetric tensor may be regarded as a partially symmetric tensor in several different ways. These produce different notions of rank for the symmetric tensor which are related by chains of inequalities. By exploiting algebraic tools such…
This work studies the maximum possible sign rank of $N \times N$ sign matrices with a given VC dimension $d$. For $d=1$, this maximum is {three}. For $d=2$, this maximum is $\tilde{\Theta}(N^{1/2})$. For $d >2$, similar but slightly less…
Exact upper bounds on the Winsorised-tilted mean of a random variable in terms of its first two moments are given. Such results are needed in work on nonuniform Berry--Esseen-type bounds for general nonlinear statistics. As another…