English
Related papers

Related papers: Schur complements for tensors and multilinear comm…

200 papers

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

Computational Complexity · Computer Science 2012-03-05 Boris Alexeev , Michael Forbes , Jacob Tsimerman

We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing…

Combinatorics · Mathematics 2026-05-13 Giuseppe Cotardo , Ferdinando Zullo

We show that the Zagier-Eisenstein series shares its non-holomorphic part with certain weak Maass forms whose holomorphic parts are generating functions for overpartition rank differences. This has a number of consequences, including exact…

Number Theory · Mathematics 2007-12-06 Kathrin Bringmann , Jeremy Lovejoy

We show that the left and right adjoint of the Schur functor can be expressed in terms of the monoidal structure of strict polynomial functors. Using this result we give a necessary and sufficient condition for when the tensor product of…

Representation Theory · Mathematics 2016-01-21 Rebecca Reischuk

We study the subrank of real order-three tensors and give an upper bound to the subrank of a real tensor given its complex subrank. Using similar arguments to those used by Bernardi-Blekherman-Ottaviani, we show that all subranks between…

Algebraic Geometry · Mathematics 2025-03-24 Benjamin Biaggi , Jan Draisma , Sarah Eggleston

A notion of generalized $n$-semimodularity is introduced, which extends that of (sub/super)mod\-ularity in four ways at once. The main result of this paper, stating that every generalized $(n\colon\!2)$-semimodular function on the $n$th…

Probability · Mathematics 2019-02-15 Iosif Pinelis

This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as…

Rings and Algebras · Mathematics 2023-05-29 Harm Derksen , Igor Klep , Visu Makam , Jurij Volčič

We consider representations of tensors as sums of decomposable tensors or, equivalently, decomposition of multilinear forms into one--forms. In this short note we show that there exists a particular finite strongly orthogonal decomposition…

Numerical Analysis · Mathematics 2014-09-19 Juan Manuel Peña , Tomas Sauer

Here we characterize the linear operators that preserve rank of matrices over additively idempotent and multiplicatively cancellative semirings. The main results in this article generalize the corresponding results on the two element…

Rings and Algebras · Mathematics 2018-07-18 A. K. Bhuniya , Sushobhan Maity

We prove a version of the Hodge-Riemann bilinear relations for Schur polynomials of K\"ahler forms and for Schur polynomials of positive forms on a complex vector space.

Algebraic Geometry · Mathematics 2022-07-05 Julius Ross , Matei Toma

For a quasi-compact quasi-separated scheme X and an arbitrary scheme Y we show that the pullback construction implements an equivalence between the discrete category of morphisms Y --> X and the category of cocontinuous tensor functors…

Algebraic Geometry · Mathematics 2014-10-07 Martin Brandenburg , Alexandru Chirvasitu

We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several…

Combinatorics · Mathematics 2021-03-31 David Anderson , William Fulton

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 consider the tensor product of the completely depolarising channel on $d\times d$ matrices with the map of Schur multiplication by a $k \times k$ correlation matrix and characterise, via matrix theory methods, when such a map is a mixed…

Quantum Physics · Physics 2018-11-22 Samuel J. Harris , Rupert H. Levene , Vern I. Paulsen , Sarah Plosker , Mizanur Rahaman

Let Y be the variety of (skew) symmetric nxn-matrices of rank less than or equal to r. In paper we construct a full faithful embedding between the derived category of a non-commutative resolution of Y, constructed earlier by the authors,…

Algebraic Geometry · Mathematics 2016-05-17 Špela Špenko , Michel Van den Bergh

We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…

Combinatorics · Mathematics 2026-02-17 Per Alexandersson , James Haglund , George Wang

We study the generic and typical ranks of 3-tensors of dimension l x m x n using results from matrices and algebraic geometry. We state a conjecture about the exact values of the generic rank of 3-tensors over the complex numbers, which is…

Algebraic Geometry · Mathematics 2011-01-25 Shmuel Friedland

By introducing Lenard recursion equations, we derive a general coupled nonlinear Sch$\mathrm{\ddot{o}}$dinger (CNLS) hierarchy associated with well-known Manakov system and Sasa-Satsuma system. Based on the characteristic polynomial of Lax…

Exactly Solvable and Integrable Systems · Physics 2012-04-26 Yu Hou , Engui Fan

Conjugate partial-symmetric (CPS) tensors are the high-order generalization of Hermitian matrices. As the role played by Hermitian matrices in matrix theory and quadratic optimization, CPS tensors have shown growing interest recently in…

Optimization and Control · Mathematics 2018-02-27 Taoran Fu , Bo Jiang , Zhening Li

A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…

Information Theory · Computer Science 2021-03-23 Eimear Byrne , Giuseppe Cotardo