相关论文: Norms of idempotent Schur multipliers

We define the Schur multipliers of a separable von Neumann algebra M with Cartan masa A, generalising the classical Schur multipliers of $B(\ell^2)$. We characterise these as the normal A-bimodule maps on M. If M contains a direct summand…

A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in…

It is well-known that if T is a D_m-D_n bimodule map on the m by n complex matrices, then T is a Schur multiplier and $\|T\|_{cb}=\|T\|$. If n=2 and T is merely assumed to be a right D_2-module map, then we show that $\|T\|_{cb}=\|T\|$.…

A Schur multiplier is a linear map on matrices which acts on its entries by multiplication with some function, called the symbol. We consider idempotent Schur multipliers, whose symbols are indicator functions of smooth Euclidean domains.…

We develop a symbol calculus for normal bimodule maps over a masa that is the natural analogue of the Schur product theory. Using this calculus we are able to easily give a complete description of the ranges of contractive normal bimodule…

We consider the Schur multipliers of finite dimensional nilpotent Lie algebras. If the algebra has dimension greater than one, then the Schur multiplier is non-zero. We give a direct proof of an upper bound for the dimension of the Schur…

We give necessary and sufficient conditions for a Schur map to be a homomorphism, with some generalizations to the infinite-dimensional case. In the finite-dimensional case, we find that a Schur multiplier distributes over matrix…

Let G be a locally compact group L^p(G) be the usual L^p-space for 1 =< p =< infty and A(G) be the Fourier algebra of G. Our goal is to study, in a new abstract context, the completely bounded multipliers of A(G), which we denote…

A graph is Schur-positive if its chromatic symmetric function expands non-negatively in the Schur basis. We determine a full Schur-positivity classification for complete multipartite graphs by showing that a complete multipartite graph…

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…

We give a characterisation of the idempotents of the partition monoid, and use this to enumerate the idempotents in the finite partition, Brauer and partial Brauer monoids, giving several formulae and recursions for the number of…

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.…

The ring of symmetric functions can be implemented in the homology of \union_{a,b} Gr(a,a+b), the multiplicative structure being defined from the "direct sum" map. There is a natural circle action (simultaneously on all Grassmannians) under…

The paper concerns nilpotent associative dialgebras and their corresponding diassociative Schur multipliers. Using Lie (and group) theory as a guide, we first extend a classic five-term cohomological sequence under alternative conditions in…

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

From [Problem 1729, Groups of prime power order, Vol. 3], Berkovich et al. asked to obtain the Schur multiplier and the representation of a group $G$, when $G$ is a special $p$-group minimally generated by $d$ elements and…

We present a formula for the Schur multiplier norm of a complex self-adjoint matrix, and a formula for the norm, which is dual to the Schur multiplier norm, of a self-adjoint matrix. For a complex self-adjoint $n \times n $ matrix $X$ we…

Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…

A linear map $u\colon \ E\to F$ between operator spaces is called completely co-bounded if it is completely bounded as a map from $E$ to the opposite of $F$. We give several simple results about completely co-bounded Schur multipliers on…

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,…