English
Related papers

Related papers: Extremal Schur Multipliers

200 papers

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…

Operator Algebras · Mathematics 2007-05-23 Kenneth R. Davidson , Allan P. Donsig

In this study, the problem of robust Schur stability of $n\times n$ dimensional matrix segments by using the bialternate product of matrices is considered. It is shown that the problem can be reduced to the existence of negative eigenvalues…

Optimization and Control · Mathematics 2024-06-28 Serife Yilmaz

We show the following version of the Schur's product theorem. If $M=(M_{j,k})_{j,k=1}^n\in{\mathbb R}^{n\times n}$ is a positive semidefinite matrix with all entries on the diagonal equal to one, then the matrix $N=(N_{j,k})_{j,k=1}^n$ with…

Numerical Analysis · Mathematics 2020-04-02 Jan Vybíral

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…

Functional Analysis · Mathematics 2023-01-13 Erik Christensen

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…

Functional Analysis · Mathematics 2026-04-28 Erik Christensen

Given two m x n matrices A = (a_{ij}) and B=(b_{ij}) with entries in B(H), the Schur block product is the m x n matrix A \square B := (a_{ij}b_{ij}). There exists an m x n contraction matrix S = (s_{ij}), such that A \square B =…

Operator Algebras · Mathematics 2019-11-11 Erik Christensen

We present a preliminary study of Schur norms $\|M\|_{S}=\max\{ \|M\circ C\|: \|C\|=1\}$, where M is a matrix whose entries are $\pm1$, and $\circ$ denotes the entrywise (i.e., Schur or Hadamard) product of the matrices. We show that, if…

Combinatorics · Mathematics 2024-07-18 John Holbrook , Nathaniel Johnston , Jean-Pierre Schoch

For an $m \times n$ complex matrix $X$ of rank $r$ with Schur multiplier $S_X$ we show that there exist an $ r \times m $ complex matrix $L$ and an $ r\times n $ complex matrix $R$ such that $X = L^*R$ and $\|S_X\|\, =\, \|\mathrm{diag}…

Operator Algebras · Mathematics 2023-01-13 Erik Christensen

In this paper, we will consider matrices with entries in the space of operators $\mathcal{B}(H)$, where $H$ is a separable Hilbert space, and consider the class of (left or right) Schur multipliers that can be approached in the multiplier…

Functional Analysis · Mathematics 2018-10-21 O. Blasco , I. García-Bayona

We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, we improve a bound due to I. Schur.

Functional Analysis · Mathematics 2007-05-23 Vladimir Nikiforov

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

Classical Analysis and ODEs · Mathematics 2023-10-30 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

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…

Operator Algebras · Mathematics 2014-06-17 Dan Kucerovsky , Aydin Sarraf

It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…

Functional Analysis · Mathematics 2015-09-29 Jianlian Cui , Chi-Kwong Li , Nung-Sing Sze

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

Number Theory · Mathematics 2024-08-09 Ilya D. Shkredov , Igor E. Shparlinski

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…

Operator Algebras · Mathematics 2018-08-22 Rupert H. Levene , Nico Spronk , Ivan G. Todorov , Lyudmila Turowska

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

Combinatorics · Mathematics 2025-09-16 Masaki Hidaka , Minoru Itoh

The joint spectral radius of a bounded set of $d \times d$ real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn…

Optimization and Control · Mathematics 2017-05-24 Kevin G. Hare , Ian D. Morris , Nikita Sidorov

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…

Group Theory · Mathematics 2013-05-20 Urban Jezernik

Let r >= s >= 0 be integers and G be an r-graph. The higher inclusion matrix M_s^r(G) is a {0,1}-matrix with rows indexed by the edges of G and columns indexed by the subsets of V(G) of size s: the entry corresponding to an edge e and a…

Combinatorics · Mathematics 2017-05-17 Codrut Grosu , Yury Person , Tibor Szabo

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

Computational Complexity · Computer Science 2013-06-04 J. M. Landsberg , Giorgio Ottaviani
‹ Prev 1 2 3 10 Next ›