Metraipolis › archive › dc_602e89bd6434

Polynomial Bounds on Degeneration Order from Commutativity Properties of Tensor Slices — arXiv:2608.10179

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10179
License (as archived)
CC0-1.0
Archived
2026-10-19T06:38:22.923Z
SHA-256 of the archived text
97bcea399fd6ba518eb6e8cbe7c11f121569d19e834d39acf4f19fc580f899b0
Stable URL of this page
https://metraipolis.com/documento/dc_602e89bd6434

How to cite

Polynomial Bounds on Degeneration Order from Commutativity Properties of Tensor Slices — arXiv:2608.10179 — arXiv (en), https://arxiv.org/abs/2608.10179 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_602e89bd6434 (Metraipolis archive dc_602e89bd6434, sha256 97bcea399fd6ba518eb6e8cbe7c11f121569d19e834d39acf4f19fc580f899b0)
BibTeX
@misc{dc602e89bd6434,
  title = {Polynomial Bounds on Degeneration Order from Commutativity Properties of Tensor Slices — arXiv:2608.10179},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10179},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_602e89bd6434; sha256 97bcea399fd6ba518eb6e8cbe7c11f121569d19e834d39acf4f19fc580f899b0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10179. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A tensor has border rank at most $r$ if it can be written as $T=\lim_{\varepsilon \rightarrow 0} T(\varepsilon)$ where $T(\varepsilon)$ has rank at most $r$ for all sufficiently small $\varepsilon$. It is known that the map $\varepsilon \mapsto T(\varepsilon)$ can be assumed to be a (tensor valued) polynomial in $\varepsilon$. The smallest possible degree of such a map is called the error degree of $T$. The error degree and the related notion of order of degeneration are the two key quantities that we study in this paper. One motivation comes from debordering: by polynomial interpolation on the map $\varepsilon \mapsto T(\varepsilon)$ we can upper bound the tensor rank of $T$. For order 3 tensors, exponential upper bounds on the error degree and degeneration order were given almost 40 years ago in (Lehmkuhl Lickteig, 1989) and were not improved ever since. In this paper we give bounds that apply to a wide class of tensors, exponentially improving on (Lehmkuhl Lickteig, 1989). Our results are most general for tensors with 3 slices (format $m \times n \times 3$). In this case, our main assumption is on the rank of the matrix slices. We also give bounds that apply to arbitrary rectangular formats ($m \times n \times p$). In this case, we need an additional 1-regularity assumption on one of the slices of the tensor (recall that a matrix is said to be 1-regular if its eigenspaces are 1-dimensional). Under these assumptions we show that the error degree is at most 1, which yields a nontrivial debordering result (tensor rank at most $2r$ for border rank $r$). The results in (Lehmkuhl Lickteig, 1989) rely on an upper bound on the degree of the variety of tensors of border rank at most $r$. We rely instead on more specific properties of this algebraic variety, and in particular on commutativity properties of certain matrices derived from the tensor slices.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in cs.CC).
Categorie arXiv: Computational Complexity (cs.CC) ; Algebraic Geometry (math.AG); Rings and Algebras (math.RA).
Pagina del lavoro: https://arxiv.org/abs/2608.10179 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T06:29:36.511Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).