Related papers: Block complexity and idempotent Schur multipliers

We call a multivariable polynomial an Agler denominator if it is the denominator of a rational inner function in the Schur-Agler class, an important subclass of the bounded analytic functions on the polydisk. We give a necessary and…

Consider rectangular matrices over a commutative ring R. Assume the ideal of maximal minors factorizes, I_m(A)=J_1*J_2. When is A left-right equivalent to a block-diagonal matrix? (When does the module/sheaf Coker(A) decompose as the…

We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…

We define an extended Bloch group and show it is isomorphic to $H_3(PSL(2,C)^\delta;Z)$. Using the Rogers dilogarithm function this leads to an exact simplicial formula for the universal Cheeger-Simons class on this homology group. It also…

Let $G$ be a finite group. If $\Gamma$ is a permutation group with $G_{right}\leq\Gamma\leq Sym(G)$ and $\mathcal{S}$ is the set of orbits of the stabilizer of the identity $e=e_{G}$ in $\Gamma$, then the $\mathbb{Z}$-submodule…

An explicit formula for the Schur multiplier of the group of unitriangular matrices over products of cyclic rings $\ZZ/m\ZZ$ and $\ZZ$ is derived. We use it to provide presentations of the corresponding covering groups and touch upon the…

We prove a lower bound $\Omega\left(\frac{k+l}{k^2l^2}N^{2-\frac{k+l+2}{kl}}\right)$ on the maximal possible weight of a $(k,l)$-free (that is, free of all-ones $k\times l$ submatrices) Boolean circulant $N \times N$ matrix. The bound is…

An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices…

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

In this paper, we define Orlov-Schulman's operators $M_L$, $M_R$, and then use them to construct the additional symmetries of the bigraded Toda hierarchy (BTH). We further show that these additional symmetries form an interesting infinite…

A non-unital algebra in a closed monoidal category is called self-induced if the multiplication induces an isomorphism between A\otimes_A A and A. For such an algebra, we define smoothening and roughening functors that retract the category…

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…

Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m x n matrices. Based on the theory of operator spaces and completely bounded mappings we present norm optimal versions of these…

We show that in $\text{O}(D)$ invariant matrix theories containing a large number $D$ of complex or Hermitian matrices, one can define a $D\rightarrow\infty$ limit for which the sum over planar diagrams truncates to a tractable, yet…

A list $\Lambda =\{\lambda _{1},\ldots ,\lambda _{n}\}$ of complex numbers (repeats allowed) is said to be \textit{realizable} if it is the spectrum of an entrywise nonnegative matrix $A$. $\Lambda $ is \textit{diagonalizably realizable} if…

Let $p$ be an odd prime. For nontrivial proper subsets $A,B$ of $\mathbb{Z}_p$ of cardinality $s,t$, respectively, we count the number $r(A,B,B)$ of additive triples, namely elements of the form $(a, b, a+b)$ in $A \times B \times B$. For…

We exhibit an explicit construction for the second cohomology group $H^2(L, A)$ for a Lie ring $L$ and a trivial $L$-module $A$. We show how the elements of $H^2(L, A)$ correspond one-to-one to the equivalence classes of central extensions…

The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…

We consider polynomials of the form $\operatorname{s}_\lambda(y_1^{[\varkappa_1]},\ldots,y_n^{[\varkappa_n]})$, where $\lambda$ is an integer partition, $\operatorname{s}_\lambda$ is the Schur polynomial associated to $\lambda$, and…

Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…