The next gap in the subrank of 3-tensors

• URL: http://arxiv.org/abs/2307.06115v1
• Date: Wed, 12 Jul 2023 12:14:54 GMT
• Title: The next gap in the subrank of 3-tensors
• Abstract summary: We show that the subrank and slice rank of any nonzero 3-tensor is discrete (in several regimes) We determine exactly the next gap, showing that the subrank and slice rank of any nonzero 3-tensor is discrete (in several regimes)
• Score: 3.8073142980733
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent works of Costa-Dalai, Christandl-Gesmundo-Zuiddam, Blatter-Draisma-Rupniewski, and Bri\"et-Christandl-Leigh-Shpilka-Zuiddam have investigated notions of discreteness and gaps in the possible values that asymptotic tensor ranks can take. In particular, it was shown that the asymptotic subrank and asymptotic slice rank of any nonzero 3-tensor is equal to 1, equal to 1.88, or at least 2 (over any field), and that the set of possible values of these parameters is discrete (in several regimes). We determine exactly the next gap, showing that the asymptotic subrank and asymptotic slice rank of any nonzero 3-tensor is equal to 1, equal to 1.88, equal to 2, or at least 2.68.

Related papers

• Precise spectral asymptotics, exponential localization, and spectral gap estimates for the three-boson lattice Schrödinger operator [0.0]
  We present a corrected strong-coupling Birman-Schwinger analysis of the three-boson lattice Schroedinger operator on Z2 at the exceptional quasimomentum K=pi.
  arXiv  Detail & Related papers  (2026-09-02T11:57:11Z)
• Separable Counterexamples to Complementary Quantum Correlations, and Why Random Search Missed Them [0.0]
  We show that CQC relation bounds the sum of two classical mutual informations, obtained from local mutually unbiased measurements.<n>We also give a state-dependent corrected inequality that is universal, and show it is with CQC already at (2times2)
  arXiv  Detail & Related papers  (2026-08-14T18:21:29Z)
• AI-Assisted Discovery of Convex Relaxations via Dual Agents [56.60366723277675]
  We show that a lower bound holds for every admissible function and follows from a convex relaxation giving stronger bounds.<n>A theory verifies each agent one and searches for counterexamples, and every reported bound is certified by an explicit dual-feasible point in the interval.
  arXiv  Detail & Related papers  (2026-06-30T06:10:25Z)
• Non-asymptotic Tail Bounds for the Kostlan--Shub--Smale Field: Tensor PCA and Spherical $k$-Spin Complexity [0.6627152091494143]
  This paper builds a hierarchy of explicit, non-asymptotic tail bounds for the supremum of the Kostlan--Shub--Smale random field on the sphere.<n>It applies it to two problems: Spiked PCA and the landscape of the spherical $k$-spin model.
  arXiv  Detail & Related papers  (2026-06-16T08:27:25Z)
• Identifiability and Stability of Generative Drifting with Companion-Elliptic Kernel Families [0.0]
  This paper analyzes identifiability and stability for the drifting field underlying distributional matching.<n>For each kernel in this class and each pair of Borel probability measures, we prove that the drifting field vanishes if and only if the two probability measures are equal.
  arXiv  Detail & Related papers  (2026-04-27T08:56:39Z)
• Quantum Search with a Generalized Laplacian [0.0]
  A single excitation in a quantum spin network can effect a variety of continuous-time quantum walks on unweighted graphs.<n>We show that the Heisenberg model can effect these three quantum walks on signed weighted graphs.
  arXiv  Detail & Related papers  (2025-06-27T08:27:01Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Topological Discrimination of Steep to Supersteep Gap as Evidence of Tunneling in Adiabatic Quantum Processes [0.0]
  It is shown that the gap that limits the speed of a quantum annealing process can take three salient morphologies. The position of the swallow tails relative to the boundary allows the supersteep versus steep discrimination. The absence of swallow tail-boundary interaction characterizes the mild gap.
  arXiv  Detail & Related papers  (2023-11-17T05:34:08Z)
• Rigorous derivation of the Efimov effect in a simple model [68.8204255655161]
  We consider a system of three identical bosons in $mathbbR3$ with two-body zero-range interactions and a three-body hard-core repulsion of a given radius $a>0$.
  arXiv  Detail & Related papers  (2023-06-21T10:11:28Z)
• Discreteness of asymptotic tensor ranks [7.916635054977068]
  We show that the subrank and the slice rank have no accumulation points, and that over the complex numbers, the slice rank has no accumulation points. Central to our approach are two new general lower bounds on the subrank of tensors, which measures how much a tensor can be diagonalized. Our rely on new lower bounds on the maximum rank in matrix subspaces that are obtained by slicing a three-tensor in the three different directions.
  arXiv  Detail & Related papers  (2023-06-02T17:42:39Z)
• Generalization Bounds for Inductive Matrix Completion in Low-noise Settings [46.82705757568271]
  We study inductive matrix completion (matrix completion with side information) under an i.i.d. subgaussian noise assumption. We obtain for the first time generalization bounds with the following three properties.
  arXiv  Detail & Related papers  (2022-12-16T08:30:41Z)
• Beyond the Edge of Stability via Two-step Gradient Updates [49.03389279816152]
  Gradient Descent (GD) is a powerful workhorse of modern machine learning. GD's ability to find local minimisers is only guaranteed for losses with Lipschitz gradients. This work focuses on simple, yet representative, learning problems via analysis of two-step gradient updates.
  arXiv  Detail & Related papers  (2022-06-08T21:32:50Z)
• Trimer states with $\mathbb{Z}_3$ topological order in Rydberg atom arrays [0.0]
  We study the quantum states obtained as equal-weight superpositions of all trimer coverings of a lattice. We show that these states can host $mathbbZ_3$ topological order or can be gapless liquids with $mathrmU(1) times mathrmU(1)$ local symmetry.
  arXiv  Detail & Related papers  (2022-05-20T18:04:58Z)
• Non-Gaussian superradiant transition via three-body ultrastrong coupling [62.997667081978825]
  We introduce a class of quantum optical Hamiltonian characterized by three-body couplings. We propose a circuit-QED scheme based on state-of-the-art technology that implements the considered model.
  arXiv  Detail & Related papers  (2022-04-07T15:39:21Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Anomalous-order exceptional point and non-Markovian Purcell effect at threshold in one-dimensional continuum systems [0.0]
  A quantum emitter is coupled near threshold (band edge) to a one-dimensional continuum with a van Hove in the density of states. A characteristic triple level convergence occurs directly on the threshold as the coupling $g$ is shut off. We show that the combination of these effects results in quantum emitter decay of the unusual form $1 - C t3/2$ on the key timescale.
  arXiv  Detail & Related papers  (2021-04-14T15:27:30Z)
• ROOT-SGD: Sharp Nonasymptotics and Near-Optimal Asymptotics in a Single Algorithm [71.13558000599839]
  We study the problem of solving strongly convex and smooth unconstrained optimization problems using first-order algorithms. We devise a novel, referred to as Recursive One-Over-T SGD, based on an easily implementable, averaging of past gradients. We prove that it simultaneously achieves state-of-the-art performance in both a finite-sample, nonasymptotic sense and an sense.
  arXiv  Detail & Related papers  (2020-08-28T14:46:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.