English
Related papers

Related papers: On Matrix Rearrangement Inequalities

200 papers

In this paper, we prove a trace inequality $\text{Tr}[ f(A) A^s B^s ] \leq \text{Tr}[ f(A) (A^{1/2} B A^{1/2} )^s ]$ for any positive and monotone increasing function $f$, $s\in[0,1]$, and positive semi-definite matrices $A$ and $B$. On the…

Mathematical Physics · Physics 2025-09-25 Po-Chieh Liu , Hao-Chung Cheng

This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…

Information Theory · Computer Science 2016-11-15 Yudong Chen

Statistical inference for stochastic block models typically relies on the spectrum of the normalized adjacency matrix $\A^*$. In practice, the true probability matrix $\mathbf{B}$ is unknown and must be replaced by a plug-in estimator…

Methodology · Statistics 2026-04-09 Jianwei Hu , Ding Chen , Ji Zhu

We define and investigate a family of permutations matrices, called shuffling matrices, acting on a set of $N=n_1\cdots n_m$ elements, where $m\geq 2$ and $n_i\geq 2$ for any $i=1,\ldots, m$. These elements are identified with the vertices…

Combinatorics · Mathematics 2017-10-17 Daniele D'Angeli , Alfredo Donno

This paper investigates the Smith normal form equivalence problem for multivariate polynomial matrices. Using methods from matrix theory and polynomial ideal theory, we prove that Frost and Storey's 1978 conjecture holds for a broad class…

Commutative Algebra · Mathematics 2026-05-12 Dong Lu , Yuanyuan Ruan , Dingkang Wang , Fanghui Xiao

Given a subset $S$ of the non-identity elements of the dihedral group of order $2m$, is it possible to order the elements of $S$ so that the partial products are distinct? This is equivalent to the sequenceability of the group when $|S| =…

Combinatorics · Mathematics 2019-04-17 M. A. Ollis

Conventional word embeddings represent words with fixed vectors, which are usually trained based on co-occurrence patterns among words. In doing so, however, the power of such representations is limited, where the same word might be…

Computation and Language · Computer Science 2020-01-10 Hongming Zhang , Jiaxin Bai , Yan Song , Kun Xu , Changlong Yu , Yangqiu Song , Wilfred Ng , Dong Yu

We use the \emph{unit-graphs} and the \emph{special unit-digraphs} on matrix rings to show that every $n \times n$ nonzero matrix over $\Bbb F_q$ can be written as a sum of two $\operatorname{SL}_n$-matrices when $n>1$. We compute the…

Combinatorics · Mathematics 2017-10-25 Yeşim Demiroğlu Karabulut

We prove an inequality that complements the famous Araki-Lieb-Thirring (ALT) inequality for positive matrices $A$ and $B$, by giving a lower bound on the quantity $\trace[A^r B^r A^r]^q$ in terms of $\trace[ABA]^{rq}$ for $0\le r\le 1$ and…

Functional Analysis · Mathematics 2011-07-01 Koenraad M. R. Audenaert

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

Combinatorics · Mathematics 2021-01-22 Willem H. Haemers , Leila Parsaei Majd

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

Combinatorics · Mathematics 2022-03-23 Konrad Aguilar , Ángel Chávez , Stephan Ramon Garcia , Jurij Volčič

Let $(s_n)_{n\ge 0}$ denote an indeterminate Hamburger moment sequence and let $\mathcal H=\{s_{m+n}\}$ be the corresponding positive definite Hankel matrix. We consider the question if there exists an infinite symmetric matrix $\mathcal…

Classical Analysis and ODEs · Mathematics 2018-10-09 Christian Berg , Ryszard Szwarc

There has recently been renewed recognition of the need to understand the consistency properties that must be preserved when a generalized matrix inverse is required. The most widely known generalized inverse, the Moore-Penrose…

Numerical Analysis · Computer Science 2018-08-03 Jeffrey Uhlmann

We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…

Functional Analysis · Mathematics 2022-04-26 Mateo Tomašević

Two matrix vector spaces $V,W\subset \mathbb C^{n\times n}$ are said to be equivalent if $SVR=W$ for some nonsingular $S$ and $R$. These spaces are congruent if $R=S^T$. We prove that if all matrices in $V$ and $W$ are symmetric, or all…

Representation Theory · Mathematics 2020-09-30 Genrich R. Belitskii , Vyacheslav Futorny , Mikhail Muzychuk , Vladimir V. Sergeichuk

This paper studies balancedness for infinite words and subshifts, both for letters and factors. Balancedness is a measure of disorder that amounts to strong convergence properties for frequencies. It measures the difference between the…

Discrete Mathematics · Computer Science 2018-10-18 Valérie Berthé , Paulina Cecchi Bernales

Motivated by applications in single-cell biology and metagenomics, we investigate the problem of matrix reordering based on a noisy disordered monotone Toeplitz matrix model. We establish the fundamental statistical limit for this problem…

Statistics Theory · Mathematics 2023-08-15 T. Tony Cai , Rong Ma

We study word maps with constants on symmetric groups. Even though there are mixed identities of bounded length that are valid for all symmetric groups, we show that no such identities hold in a metric sense. Moreover, we prove that word…

Group Theory · Mathematics 2023-05-18 Jakob Schneider , Andreas Thom

Miniversal deformations for pairs of skew-symmetric matrices under congruence are constructed. To be precise, for each such a pair $(A,B)$ we provide a normal form with a minimal number of independent parameters to which all pairs of…

Representation Theory · Mathematics 2016-06-13 Andrii Dmytryshyn

Let $S(X,B)$ be a symmetric (``palindromic'') word in two letters $X$ and $B$. A theorem due to Hillar and Johnson states that for each pair of positive definite matrices $B$ and $P$, there is a positive definite solution $X$ to the word…

Operator Algebras · Mathematics 2007-05-23 Scott N. Armstrong , Christopher J. Hillar
‹ Prev 1 8 9 10 Next ›