English
Related papers

Related papers: A note on matrices mapping a positive vector onto …

200 papers

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

Combinatorics · Mathematics 2014-04-21 Christine Bessenrodt , Richard P. Stanley

We investigate determinantal varieties for symmetric matrices that have zero blocks along the main diagonal. In theoretical physics, these arise as Gram matrices for kinematic variables in quantum field theories. We study the ideals of…

Commutative Algebra · Mathematics 2026-05-19 Yassine El Maazouz , Bernd Sturmfels , Svala Sverrisdóttir

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Combinatorics · Mathematics 2021-04-22 Eugene Kogan

We consider polynomials in R[x] which map the set of nonnegative (element-wise) matrices of a given order into itself. Let n be a positive integer and define P(n)= {p in R[x] : p(A) is nonnegative (element-wise), for all A, A an n-by-n…

Rings and Algebras · Mathematics 2022-02-02 Raphael Loewy

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

Rings and Algebras · Mathematics 2026-03-02 Louis H. Rowen , Uzi Vishne

A family of random matrices $\boldsymbol{X}^N=(X_1^N,\ldots,X_d^N)$ is said to converge strongly to a family of bounded operators $\boldsymbol{x}=(x_1,\ldots,x_d)$ when $\|P(\boldsymbol{X}^N,\boldsymbol{X}^{N*})\|\to\|P(\boldsymbol{x},…

Probability · Mathematics 2026-03-09 Chi-Fang Chen , Jorge Garza-Vargas , Joel A. Tropp , Ramon van Handel

We characterize ratios of permanents of (generalized) submatrices which are bounded on the set of all totally positive matrices. This provides a permanental analog of results of Fallat, Gekhtman, and Johnson [{\em Adv.\ Appl.\ Math.} {\bf…

Combinatorics · Mathematics 2024-06-04 Mark Skandera , Daniel Soskin

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…

Functional Analysis · Mathematics 2018-03-29 Ilya M. Spitkovsky , Anatoly F. Voronin

Stochastic matrices and positive maps in matrix algebras proved to be very important tools for analysing classical and quantum systems. In particular they represent a natural set of transformations for classical and quantum states,…

Quantum Physics · Physics 2015-10-28 D. Chruściński , V. I. Man'ko , G. Marmo , F. Ventriglia

We give a short proof of a recent result of Drury on the positivity of a $3\times 3$ matrix of the form $(\|R_i^*R_j\|_{\rm tr})_{1 \le i, j \le 3}$ for any rectangular complex (or real) matrices $R_1, R_2, R_3$ so that the multiplication…

Rings and Algebras · Mathematics 2014-08-25 Chi-Kwong Li , Fuzhen Zhang

We study a class of matrices with noncommutative entries, which were first considered by Yu. I. Manin in 1988 in relation with quantum group theory. They are defined as "noncommutative endomorphisms" of a polynomial algebra. More explicitly…

Quantum Algebra · Mathematics 2009-01-05 A. Chervov , G. Falqui , V. Rubtsov

For an $n\times n$ diagonally dominant matrix $T=(t_{i,j})_{n\times n}$ with positive elements satisfying certain bounding conditions, we propose to use a diagonal matrix $S=(s_{i,j})_{n\times n}$ to approximate the inverse of $T$, where…

Numerical Analysis · Mathematics 2019-02-05 Ting Yan

Let $M_{n}$ denote a random symmetric $n\times n$ matrix, whose entries on and above the diagonal are i.i.d. Rademacher random variables (taking values $\pm 1$ with probability $1/2$ each). Resolving a conjecture of Vu, we prove that the…

Probability · Mathematics 2021-10-29 Matthew Kwan , Lisa Sauermann

Let $L$ be a linear operator on univariate polynomials of bounded degree, mapping into real symmetric matrices, such that its moment matrix is positive definite. It is known that $L$ admits a finitely atomic positive matrix-valued…

Functional Analysis · Mathematics 2025-09-01 Aljaž Zalar , Igor Zobovič

The Schur product of two complex m x n matrices is their entry wise product. We show that an extremal element X in the convex set of m x n complex matrices of Schur multiplier norm at most 1 satisfies the inequality rank(X) =< (m +n)^(1/2)…

Functional Analysis · Mathematics 2024-10-29 Erik Christensen

Let $A_i$ and $B_i$ be positive definite matrices for every $i=1,\cdots,m.$ Let $Z=[Z_{ij}]$ be the block matrix, where $Z_{ij}=B_i^{^\frac{1}{_2}}\left(\displaystyle\sum_{k=1}^mA_k\right)B_j^{^\frac{1}{_2}}$ for every $ i,j=~1,\cdots,m$.…

Functional Analysis · Mathematics 2024-01-02 Shaima'a Freewan , Mostafa Hayajneh

A multidimensional nonnegative matrix is called polystochastic if the sum of its entries over each line is equal to $1$. The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. We prove that if $d$…

Combinatorics · Mathematics 2025-12-01 A. L. Perezhogin , V. N. Potapov , A. A. Taranenko , S. Yu. Vladimirov

Newton's inequalities $c_n^2 \ge c_{n-1}c_{n+1}$ are shown to hold for the normalized coefficients $c_n$ of the characteristic polynomial of any $M$- or inverse $M$-matrix. They are derived by establishing first an auxiliary set of…

Rings and Algebras · Mathematics 2007-05-23 Olga Holtz

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $\Phi: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed…

Functional Analysis · Mathematics 2023-02-23 Chi-Kwong Li , Ming-Cheng Tsai , Ya-Shu Wang , Ngai-Ching Wong

A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…

Combinatorics · Mathematics 2020-02-07 Joyentanuj Das , Sachindranath Jayaraman , Sumit Mohanty
‹ Prev 1 3 4 5 6 7 10 Next ›