Border subrank of higher order tensors and algebras

• URL: http://arxiv.org/abs/2604.19872v1
• Date: Tue, 21 Apr 2026 18:00:04 GMT
• Title: Border subrank of higher order tensors and algebras
• Abstract summary: We determine the border subrank of higher order structure tensors of several families of algebras.<n>We prove that degeneration of structure tensors of algebras propagates from higher to lower order.
• Score: 1.3509194648045753
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and $k$-fold upper triangular matrix multiplication for all $k$. (2) We determine the border subrank of the higher order structure tensors of truncated polynomial algebras, null algebras, and apolar algebras of a quadric. (3) We determine the border subrank of the higher order structure tensors of the Lie algebra $\mathfrak{sl}_2$ for all orders. (4) We prove that degeneration of structure tensors of algebras propagates from higher to lower order. Along the way, we investigate which upper bound methods (geometric rank, $G$-stable rank, socle degree) are effective in which settings, and how they relate. Our work extends the results of Strassen (J.~Reine Angew.~Math., 1987, 1991), who determined the asymptotic subrank of these algebras for tensors of order three, in two directions: we determine the border subrank itself rather than its asymptotic version, and we consider higher order structure tensors.

Related papers

• Triangular tensor networks, pencils of matrices and beyond [45.88028371034407]
  We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2.<n>We provide a complete characterization of these varieties in terms of the Kronecker invariants of pencils.
  arXiv  Detail & Related papers  (2026-02-16T19:00:04Z)
• Asymptotic tensor rank is characterized by polynomials [9.730863921742644]
  Strassen's rank conjecture makes the bold claim that tensor rank equals the largest dimension of a tensor. We prove that rank is "computable from above", that is, for any real $r$ there is an (efficient) algorithm that determines, given a tensor $T$, if the tensor rank of $T$ is at most $r$.
  arXiv  Detail & Related papers  (2024-11-24T11:35:38Z)
• Overcomplete Tensor Decomposition via Koszul-Young Flattenings [56.82556231289414]
  We give a new algorithm for decomposing an $n_times n times n_3$ tensor as the sum of a minimal number of rank-1 terms.<n>We show that an even more general class of degree-$d$s cannot surpass rank $Cn$ for a constant $C = C(d)$.
  arXiv  Detail & Related papers  (2024-11-21T17:41:09Z)
• Discreteness of asymptotic tensor ranks [7.378597079944368]
  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.<n>Central to our approach are two new general lower bounds on the subrank of tensors, which measures how much a tensor can be diagonalized.<n>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)
• A Gap in the Subrank of Tensors [2.7992435001846827]
  The subrank of tensors is a measure of how much a tensor can be ''diagonalized'' We prove that there is a gap in the subrank when taking large powers under the tensor product. We also prove that there is a second gap in the possible rates of growth.
  arXiv  Detail & Related papers  (2022-12-03T18:38:28Z)
• Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials [93.59919600451487]
  "Statistical-computational gaps" occur in many statistical inference tasks. We consider a model for random order-3 decomposition where one component is slightly larger in norm than the rest. We show that tensor entries can accurately estimate the largest component when $ll n3/2$ but fail to do so when $rgg n3/2$.
  arXiv  Detail & Related papers  (2022-11-10T00:40:37Z)
• Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
  We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk. The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra. As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
  arXiv  Detail & Related papers  (2022-08-12T15:05:07Z)
• Polynomial algebras of superintegrable systems separating in Cartesian coordinates from higher order ladder operators [0.618778092044887]
  We introduce the general algebras characterizing a class of higher order superintegrable systems that separate in coordinates. The construction relies on underlying Heisenberg algebras and their defining higher order ladder operators.
  arXiv  Detail & Related papers  (2022-02-27T03:33:26Z)
• Dimension of Tensor Network varieties [68.8204255655161]
  We determine an upper bound on the dimension of the tensor network variety. A refined upper bound is given in cases relevant for applications such as varieties of matrix product states and projected entangled pairs states.
  arXiv  Detail & Related papers  (2021-01-08T18:24:50Z)
• Polynomial algebras from $su(3)$ and the generic model on the two sphere [0.0]
  Construction of superintegrable systems based on Lie algebras have been introduced over the years. This is also the case for the construction of their related symmetry algebra which take usually the form of a finitely generated quadratic algebra. We develop a new approach reexamining the case of the generic superintegrable systems on the 2-sphere.
  arXiv  Detail & Related papers  (2020-07-22T02:20:10Z)
• Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems [58.83118651518438]
  We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $boldsymbolumathrmTboldsymbolMboldsymbolv$ over a fixed field. We provide new upper and lower bounds for a wide variety of problems, spanning linear algebra, statistics, and graphs.
  arXiv  Detail & Related papers  (2020-06-24T19:33:49Z)

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.