English
Related papers

Related papers: Product Ranks of the $3\times 3$ Determinant and P…

200 papers

The Laplace expansion expresses the $n \times n$ determinant $\det_n$ as a sum of $n$ products. Do shorter expansions exist? In this paper we: - Fully determine the slice rank decompositions of $\det_n$ (where each product must contain a…

Combinatorics · Mathematics 2025-09-09 Amichai Lampert , Guy Moshkovitz

We propose a numerical method to obtain an adequate value for the upper bound on the rank for the tensor completion problem on the variety of third-order tensors of bounded tensor-train rank. The method is inspired by the parametrization of…

Optimization and Control · Mathematics 2024-09-10 Charlotte Vermeylen , Guillaume Olikier , P. -A. Absil , Marc Van Barel

We prove that the general tensor of size 2^n and rank k has a unique decomposition as the sum of decomposable tensors if k<= 0.9997 (2^n)/(n+1) (the constant 1 being the optimal value). Similarly, the general tensor of size 3^n and rank k…

Algebraic Geometry · Mathematics 2013-05-14 Cristiano Bocci , Luca Chiantini , Giorgio Ottaviani

We study the relationship between the commutative and the non-commutative rank of a linear matrix. We give examples that show that the ratio of the two ranks comes arbitrarily close to 2. Such examples can be used for giving lower bounds…

Rings and Algebras · Mathematics 2016-06-22 Harm Derksen , Visu Makam

Let $m,n\geq 3$, $(m-1)(n-1)+2\leq p\leq mn$, and $u=mn-p$. The set $\mathbb{R}^{u\times n\times m}$ of all real tensors with size $u\times n\times m$ is one to one corresponding to the set of bilinear maps $\mathbb{R}^m\times…

Rings and Algebras · Mathematics 2015-12-29 Toshio Sumi , Mitsuhiro Miyazaki , Toshio Sakata

We compute the determinant of $\sum_{n=1}^{N} \vec{A}^{(n)} \otimes \vec{B}^{(n)}$, where $\vec{A}^{(n)}$ is square and ${\vec{B}^{(n)}=\vec{x}^{(n)}{\vec{y}^{(n)}}^T}$ where $\vec{x}^{(n)}$ and $\vec{y}^{(n)}$ have length $N$.

Combinatorics · Mathematics 2020-12-21 Dwight Nwaigwe

Determinantal methods for bounding the rank and border rank of tensors or polynomials are subject to a major barrier. For instance, it is known that using determinantal methods one cannot prove a lower bound for the border rank of a 3-way…

Algebraic Geometry · Mathematics 2026-02-13 Jarosław Buczyński

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…

Algebraic Geometry · Mathematics 2020-04-15 Garritt Johns , Zach Teitler

Let $G$ be a finite abelian group and $D(G)$ denote the Davenport constant of $G$. We derive new upper bound for the Davenport constant for all groups of rank three. Our main result is that: $$D(C_{n_1}\oplus C_{n_2}\oplus C_{n_3})\le…

Group Theory · Mathematics 2019-10-25 Maciej Zakarczemny

In 2010, Cassidy and Vancliff extended the notion of a quadratic form on n generators to the noncommutative setting. In this article, we suggest a notion of rank for such noncommutative quadratic forms, where n = 2 or 3. Since writing an…

Rings and Algebras · Mathematics 2019-10-22 Michaela Vancliff , Padmini Veerapen

In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…

Rings and Algebras · Mathematics 2017-02-02 Parinyawat Choosuwan , Somphong Jitman , Patanee Udomkavanich

We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite…

Computational Complexity · Computer Science 2017-04-11 Jesko Hüttenhain , Christian Ikenmeyer

Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. In this work, we propose a conjecture in which the k-rank condition of…

Combinatorics · Mathematics 2020-08-21 Benjamin Lovitz

One of the fundamental open problems in the field of tensors is the border Comon's conjecture: given a symmetric tensor $F\in(\mathbb{C}^n)^{\otimes d}$ for $d\geq 3$, its border and symmetric border ranks are equal. In this paper, we prove…

Algebraic Geometry · Mathematics 2024-11-11 Tomasz Mańdziuk , Emanuele Ventura

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

Algebraic Geometry · Mathematics 2015-01-14 Jan Draisma , Jochen Kuttler

We study typical ranks with respect to a real variety $X$. Examples of such are tensor rank ($X$ is the Segre variety) and symmetric tensor rank ($X$ is the Veronese variety). We show that any rank between the minimal typical rank and the…

Algebraic Geometry · Mathematics 2015-12-08 Alessandra Bernardi , Grigoriy Blekherman , Giorgio Ottaviani

Let $A$ be a set in a prime field $\mathbb{F}_p$. In this paper, we prove that $d\times d$ matrices with entries in $A$ determine almost $|A|^{3+\frac{1}{45}}$ distinct determinants and almost $|A|^{2-\frac{1}{6}}$ distinct permanents when…

Combinatorics · Mathematics 2019-08-14 Doowon Koh , Thang Pham , Chun-Yen Shen , Le Anh Vinh

Let F be an N x N complex matrix whose jth column is the vector f_j in C^N. Let |f_j|^2 denote the sum of the absolute squares of the entries of f_j. Hadamard's inequality for determinants states that |\det(F)| <= \prod_{j=1}^N|f_j|. Here…

Classical Analysis and ODEs · Mathematics 2007-05-23 Eric Carlen , Elliott H. Lieb , Michael Loss

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

We prove that in any $\mathbb{Z}^n$-periodic triangulation of $\mathbb{R}^n$ the number of $\mathbb{Z}^n$-orbits of $n$-dimensional simplices is at least the tensor rank of the $n$th determinant tensor. The latter is known to be at least…

Combinatorics · Mathematics 2025-09-29 Sergey Avvakumov , Roman Karasev