Related papers: Maximal Border Subrank Tensors
We prove that there is a bound on the dimension of the first cohomology group of a finite group with coefficients in an absolutely irreducible in characteristic p in terms of the sectional p-rank of the group.
We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…
We outline the construction of differential invariants for higher--rank tensors.
We obtain bounds on the number of maximal torsion cosets for algebraic subvarieties of n-tori, defined over the rationals, using model theoretic methods.
We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…
Cayley's first hyperdeterminant is a straightforward generalization of determinants for tensors. We prove that nonzero hyperdeterminants imply lower bounds on some types of tensor ranks. This result applies to the slice rank introduced by…
We give an upper-bound for the $X$-rank of points with respect to a non-degenerate irreducible variety $X$ in the case that sub-generic $X$-rank points generate a hypersurface. We give examples where this bound is sharp and it improves the…
We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
In this paper, we prove: Let A be a nonnegative primitive tensor with order m and dimension n. Then its primitive degree R(A)\leq (n-1)^2+1, and the upper bound is sharp. This confirms a conjecture of Shao [7].
We show that the border support rank of the tensor corresponding to two-by-two matrix multiplication is seven over the complex numbers. We do this by constructing two polynomials that vanish on all complex tensors with format…
We study the decomposability and the subdifferential of the tensor nuclear norm. Both concepts are well understood and widely applied in matrices but remain unclear for higher-order tensors. We show that the tensor nuclear norm admits a…
We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix…
The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…
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…
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of…
We classify tensors with maximal and next to maximal dimensional symmetry groups under a natural genericity assumption (1-genericity), in dimensions greater than 7. In other words, we classify minimal dimensional orbits in the space of…
We analyze tensors in the tensor product of three m-dimensional vector spaces satisfying Strassen's equations for border rank m. Results include: two purely geometric characterizations of the Coppersmith-Winograd tensor, a reduction to the…
We present an analytical lower bound of multipartite concurrence based on the generalized Bloch representations of density matrices. It is shown that the lower bound can be used as an effective entanglement witness of genuine multipartite…