Related papers: Schur complements for tensors and multilinear comm…

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

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…

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which…

We prove a conjecture of Cuttler et al.~[2011] [A. Cuttler, C. Greene, and M. Skandera; \emph{Inequalities for symmetric means}. European J. Combinatorics, 32(2011), 745--761] on the monotonicity of \emph{normalized Schur functions} under…

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…

Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…

We present a brief summary of the recent discovery of direct tensorial analogue of characters. We distinguish three degrees of generalization: (1) $c$-number Kronecker characters made with the help of symmetric group characters and…

We present novel equivalences in random matrix and tensor models between complex and self-adjoint theories with nontrivial quadratic terms in the action, established through an intermediate field representation. More precisely, we show that…

We prove a positive combinatorial formula for the Schur expansion of LLT polynomials indexed by a 3-tuple of skew shapes. This verifies a conjecture of Haglund. The proof requires expressing a noncommutative Schur function as a positive sum…

About last 70s, Haynsworth [6] used a result of the Schur complement to refine a determinant inequality for positive definite matrices. Haynsworth's result was improved by Hartfiel [5]. We extend their result to a larger class of matrices,…

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

We study the tensor rank of the tensor corresponding to the algebra of n-variate complex polynomials modulo the dth power of each variable. As a result we find a sequence of tensors with a large gap between rank and border rank, and thus a…

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

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…

We prove (without exceptions) the existence of irredundant tensor decompositions with the number of addenda equal to rank $+1$. We also discuss the existence of decompositions with more than the tensor rank terms, which are concise, while…

We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral domain, we prove that the rank problem is polynomial time…

We study $SU(n)$ symmetry breaking by rank three and rank two antisymmetric tensor fields. Using tensor analysis, we derive branching rules for the adjoint and antisymmetric tensor representations, and explain why for general $SU(n)$ one…

We give a combinatorial extension of the classical inequalities of Maclaurin about symmetric functions of several variables. We discuss two problems - one analytical and another combinatorial - and show that they are in some sense…

We prove the decomposition conjecture of Leclerc and Thibon for the Schur algebra. We also give a new approach to the Lusztig conjecture for the dimension of the simple U(sl_k)-modules at roots of unity via canonical bases of the Hall…

We show that the category of principal ordered face structures is equivalent to the category of multitopes. We show that the category of principal ordered face structures is equivalent to the category of multitopes. On the way we introduce…