English
Related papers

Related papers: Sharp nonzero lower bounds for the Schur product t…

200 papers

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

About last 70s, Haynsworth [6] used a result of the Schur complement to refine a determinant inequality for positive definite matrices. Haynsworth's result was improved by Hartfiel [5]. We extend their result to a larger class of matrices,…

Functional Analysis · Mathematics 2014-10-21 Minghua Lin

The purpose of this article is to further explore how the structure of the affine group can be used to deduce new incidence theorems, and to explore sum-product type applications of these incidence bounds, building on the recent work of…

Combinatorics · Mathematics 2019-05-10 Oliver Roche-Newton , Audie Warren

Let $A=\begin{bmatrix} A_{ij} \end{bmatrix}$ be an $n\times n$ operator matrix, where each $A_{ij}$ is a bounded linear operator on a complex Hilbert space. Among other numerical radius bounds, we show that $w(A)\leq w(\hat{A})$, where…

Functional Analysis · Mathematics 2023-03-21 Pintu Bhunia

In this article, we provide a definitive well-posedness theory for the free boundary problem in incompressible magnetohyrodynamics. Despite the clear physical interest in this system and the remarkable progress in the study of the free…

Analysis of PDEs · Mathematics 2024-12-23 Mihaela Ifrim , Ben Pineau , Daniel Tataru , Mitchell A. Taylor

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various…

Computational Complexity · Computer Science 2019-04-03 Mrinal Kumar , Ben Lee Volk

Bestvina's notion of a Z-structure provides a general framework for group boundaries that includes Gromov boundaries of hyperbolic groups and visual boundaries of CAT(0) groups as special cases. A refinement, known as an EZ-structure has…

Geometric Topology · Mathematics 2022-07-19 Craig R. Guilbault , Brendan Burns Healy , Brian Pietsch

We show that a QWEP von Neumann algebra has the weak* positive approximation property if and only if it is seemingly injective in the following sense: there is a factorization of the identity of $M$ $$Id_M=vu: M{\buildrel…

Operator Algebras · Mathematics 2023-04-05 Gilles Pisier

For a matrix $M$ and a positive integer $r$, the rank $r$ rigidity of $M$ is the smallest number of entries of $M$ which one must change to make its rank at most $r$. There are many known applications of rigidity lower bounds to a variety…

Data Structures and Algorithms · Computer Science 2021-02-25 Josh Alman

This work concerns the construction and characterization of product kernels for multivariate approximation from a finite set of discrete samples. To this end, we consider composing different component kernels, each acting on a…

Numerical Analysis · Mathematics 2024-11-27 Kristof Albrecht , Juliane Entzian , Armin Iske

Schoenberg showed that a function $f:(-1,1)\rightarrow \mathbb{R}$ such that $C=[c_{ij}]_{i,j}$ positive semi-definite implies that $f(C)=[f(c_{ij})]_{i,j}$ is also positive semi-definite must be analytic and have Taylor series coefficients…

Functional Analysis · Mathematics 2019-07-11 J. E. Pascoe

Let $X\in\mathbb{C}^{m\times m}$ and $Y\in\mathbb{C}^{n\times n}$ be nonsingular matrices, and let $N\in\mathbb{C}^{m\times n}$. Explicit expressions for the Moore-Penrose inverses of $M=XNY$ and a two-by-two block matrix, under appropriate…

Numerical Analysis · Mathematics 2017-04-20 Xuefeng Xu

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

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

Functional Analysis · Mathematics 2022-01-14 Adrian Fan , Jack Montemurro , Pavlos Motakis , Naina Praveen , Alyssa Rusonik , Paul Skoufranis , Noam Tobin

Lapid and M\'{i}nguez gave a criterion of the irreducibility of the parabolic induction $\sigma \times \pi$, where $\sigma$ is a ladder representation and $\pi$ is an arbitrary irreducible representation of the general linear group over a…

Representation Theory · Mathematics 2025-07-22 Léa Bittmann , Jian-Rong Li

We obtain upper bounds for the numerical radius of a product of Hilbert space operators which improve on the existing upper bounds. We generalize the numerical radius inequalities of $n\times n$ operator matrices by using non-negative…

Functional Analysis · Mathematics 2024-08-13 Pintu Bhunia , Kallol Paul

We develop the theory of subproduct systems over the monoid $\mathbb{N}\times \mathbb{N}$, and the non-self-adjoint operator algebras associated with them. These are double sequences of Hilbert spaces $\{X(m,n)\}_{m,n=0}^\infty$ equipped…

Operator Algebras · Mathematics 2012-03-27 Maxim Gurevich

We investigate the spectral properties of the product of $M$ complex non-Hermitian random matrices that are obtained by removing $L$ rows and columns of larger unitary random matrices uniformly distributed on the group ${\rm U}(N+L)$. Such…

Mathematical Physics · Physics 2014-06-10 Gernot Akemann , Zdzislaw Burda , Mario Kieburg , Taro Nagao

We study the simplex method over polyhedra satisfying certain "discrete curvature" lower bounds, which enforce that the boundary always meets vertices at sharp angles. Motivated by linear programs with totally unimodular constraint…

Data Structures and Algorithms · Computer Science 2014-12-23 Daniel Dadush , Nicolai Hähnle

Higham's conjecture on the growth factor of complex symmetric positive definite matrices is a longstanding problem in the stability theory of Gaussian elimination without pivoting. It asserts that every complex matrix $A=B+iC$ with $B$ and…

Numerical Analysis · Mathematics 2026-04-28 Teng Zhang