Related papers: Block complexity and idempotent Schur multipliers
In this article, we revisit some block matrix construction methods and use them to derive various general expansion formulas for calculating the ranks of matrix expressions. As applications, we derive a variety of interesting rank…
To any Schur polynomial $s_{\lambda}$ one can associated its derived polynomials $s_{\lambda}{(i)}$ $i=0,\ldots,|\lambda|$ by the rule $$s_{\lambda}(x_1+t,\ldots,x_n+t) = \sum_i s_{\lambda}^{(i)}(x_1,\ldots,x_n) t^i.$$ We conjecture that…
In this paper we construct a GL-equivariant complex of Schur modules over a ring of positive characteristic that can be used to deduce classical alternating sum identities for Schur polynomials. This complex globalizes to a complex of…
Flagged Schur modules generalize the irreducible representations of the general linear group under the action of the Borel subalgebra. Their characters include many important generalizations of Schur polynomials, such as Demazure…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…
We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the…
Determining the asymptotic algebraic complexity of matrix multiplication, succinctly represented by the matrix multiplication exponent $\omega$, is a central problem in algebraic complexity theory. The best upper bounds on $\omega$, leading…
We prove that for arbitrary partitions $\mathbf{\lambda} \subseteq \mathbf{\kappa},$ and integers $0\leq c<r\leq n,$ the sequence of Schur polynomials $S_{(\mathbf{\kappa} + k\cdot \mathbf{1}^c)/(\mathbf{\lambda} + k\cdot…
We introduce the edge Schur functions $E^{\lambda}$ that are defined as a generating series over edge labeled tableaux. We formulate $E^{\lambda}$ as the partition function for a solvable lattice model, which we use to show they are…
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…
Computing the eigenvectors and eigenvalues of a perturbed matrix can be remarkably difficult when the unperturbed matrix has repeated eigenvalues. In this work we show how the limiting eigenvectors and eigenvalues of a symmetric matrix…
Determining the matrix multiplication exponent $\omega$ is one of the greatest open problems in theoretical computer science. We show that it is impossible to prove $\omega = 2$ by starting with structure tensors of modules of fixed degree…
The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of partial transpose from a combinatorial point of view. In this perspective, we solve some basic…
Let $A_i$ and $B_i$ be positive definite matrices for every $i=1,\cdots,m.$ Let $Z=[Z_{ij}]$ be the block matrix, where $Z_{ij}=B_i^{^\frac{1}{_2}}\left(\displaystyle\sum_{k=1}^mA_k\right)B_j^{^\frac{1}{_2}}$ for every $ i,j=~1,\cdots,m$.…
Entrywise powers of matrices have been well-studied in the literature, and have recently received renewed attention in the regularization of high-dimensional correlation matrices. In this paper, we study powers of positive semidefinite…
A binary relation on a finite set is called a Hall relation if it contains a permutation of the set. Under the usual relational product, Hall relations form a semigroup which is known to be a block-group, that is, a semigroup with at most…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
Consider a completely bounded Fourier multiplier phi of a locally compact group G, and take 1 <= p <= infinity. One can associate to phi a Schur multiplier on the Schatten classes S_p(L^2 G), as well as a Fourier multiplier on Lp(LG), the…
Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…
Several new verifiable conditions are established for block matrices with scalar diagonal blocks to have the numerical range equal the convex hull of at most k ellipses where k by k is the size of the smaller diagonal block. For k = 2,…