Related papers: Extremal Schur Multipliers

The rank of the matrix multiplication operator for nxn matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least n^2-o(n^2). More precisely, for any integer p\leq n -1, the rank is at…

We enumerate staircases with fixed left and right columns. These objects correspond to ice-configurations, or alternating sign matrices, with fixed top and bottom parts. The resulting partition functions are equal, up to a normalization…

To work more accurately with elements of the semigroup of the Stone Cech compactification of the discrete semigroup of natural numbers N under multiplication. We divided these elements into ultrafilters which are on finite levels and…

We call a matrix blocky if, up to row and column permutations, it can be obtained from an identity matrix by repeatedly applying one of the following operations: duplicating a row, duplicating a column, or adding a zero row or column.…

Let $p$ be an odd prime. We describe a method to compute the Schur multiplier of finite $p$-groups $G$ of nilpotency class $2$ such that $G/[G,G]$ is isomorphic to direct product of copies of $\mathbb{Z}_{p^s}$ for $s \in \mathbb{N}$,…

Let K be an infinite field such that its characteristic is not 2. We show that, for every $A\in\mathcal{M}_n(K)$ such that $\mathrm{rank}(A)\geq n/2$, there exists $B\in\mathcal{M}_n(K)$ such that $B$ is similar to $A$ and $A+B$ is…

It follows from Grothendieck's little inequality that to any complex (m x n) matrix X of column norm at most 1, and an 0 <e <1, there exist a natural number q, an (m x q) matrix C with $(1-e)^2 \leq CC^* \leq (4/\pi) (1 + e)^2$ and an (q x…

We prove that the permutations of $\{1,\dots, n\}$ having an increasing (resp., decreasing) subsequence of length $n-r$ index a subset of the set of all $r$th Kronecker powers of $n \times n$ permutation matrices which is a basis for the…

We study the diagonal entries of the average mixing matrix of continuous quantum walks. The average mixing matrix is a graph invariant; it is the sum of the Schur squares of spectral idempotents of the Hamiltonian. It is non-negative,…

This work derives extremal tail bounds for the Gaussian trace estimator applied to a real symmetric matrix. We define a partial ordering on the eigenvalues, so that when a matrix has greater spectrum under this ordering, its estimator will…

This work is entirely devoted to construct huge families of indecomposable arithmetically Cohen-Macaulay (resp. Ulrich) sheaves E of arbitrary high rank on a general standard (resp. linear) determinantal scheme X\subset \PP^n of codimension…

We investigate the relationship between partial traces and their dilations for general complex matrices, focusing on two main aspects: the existence of (joint) dilations and norm inequalities relating partial traces and their dilations.…

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

This article focuses on those aspects about partial actions of groups which are related to Schur's theory on projective representations. It provides an exhaustive description of the partial Schur multiplier, and this result is achieved by…

For a pair of coupled rectangular random matrices we consider the squared singular values of their product, which form a determinantal point process. We show that the limiting mean distribution of these squared singular values is described…

Let $M$ be a von Neumann algebra equipped with a normal semi-finite faithful trace (nsf trace in short) and let $T\colon M\to M$ be a contraction. We say that $T$ is absolutely dilatable if there exist another von Neumann algebra $M'$…

For a finite group we introduce a particular central extension, the unitary cover, having minimal exponent among those satisfying the projective lifting property. We obtain new bounds for the exponent of the Schur multiplier relating to…

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

This book has eight chapters. The first chapter is introductory in nature. Polynomials with matrix coefficients are introduced in chapter two. Algebraic structures on these polynomials with matrix coefficients is defined and described in…

In this paper, we consider the Strichartz inequality for a fourth-order Schr\"odinger equation on $\mathbb{R}^{2+1}$. We show that extremizers exist using a linear profile decomposition which follows from the endpoint version decomposition…