Related papers: On a Norm Compression Inequality for 2XN Partition…
For any unitary matrix there exists a ZXZ decomposition, according to a theorem by Idel and Wolf. For any even-dimensional unitary matrix there exists a block-ZXZ decomposition, according to a theorem by F\"uhr and Rzeszotnik. We conjecture…
We define norms on $L_p(\mathcal{M}) \otimes M_n$ where $\mathcal{M}$ is a von Neumann algebra and $M_n$ is the complex $n \times n$ matrices. We show that a linear map $T: L_p(\mathcal{M}) \to L_q(\mathcal{N})$ is decomposable if…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
We introduce a ``two-particle factorization'' condition which allows us to formulate the homogeneous Boltzmann equation for non-reversible collision kernels in terms of an entropy inequality. This formulation yields an H-Theorem. We provide…
We present some properties of orthogonality and relate them with support disjoint and norm inequalities in p Schatten ideals. In addition, we investigate the problem of characterization of norm parallelism for bounded linear operators. We…
Let $H$ be a complex separable Hilbert space and $B(H)$ the algebra of all bounded linear operators on $H$. In this paper, we give considerable generalizations of the inequalities for norms of commutators of normal operators. Let $S, T \in…
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}…
In this paper, we study the phenomenon of Hopf or more specifically quantum double symmetry breaking. We devise a criterion for this type of symmetry breaking which is more general than the one existing in the literature, and therefore…
The aim of this paper is to present two tools, Theorems 4 and 7, that make the task of finding equivalent polyhedral norms on certain Banach spaces easier and more transparent. The hypotheses of both tools are based on countable…
If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…
For a normed linear space $(X,|\cdot|)$ and $p>0$ we characterize all $n$-tuples $(\mu_1,...,\mu_n)\in\mathbb{R}^{n}$ for which the generalized triangle inequality of the second type…
This paper derives exponential tail bounds and polynomial moment inequalities for the spectral norm deviation of a random matrix from its mean value. The argument depends on a matrix extension of Stein's method of exchangeable pairs for…
In this paper, we study the John-Nirenberg inequality for BMO and the atomic decomposition for H1 of noncommutative martingales. We first establish a crude version of the column (resp. row) John-Nirenberg inequality for all 0 < p < \infty.…
The celebrated Heinz inequality asserts that $ 2|||A^{1/2}XB^{1/2}|||\leq |||A^{\nu}XB^{1-\nu}+A^{1-\nu}XB^{\nu}|||\leq |||AX+XB|||$ for $X \in \mathbb{B}(\mathscr{H})$, $A,B\in \+$, every unitarily invariant norm $|||\cdot|||$ and $\nu \in…
We establish variant Khintchine inequalities on normed spaces of Hanner type and cotype, in which the Rademacher distribution corresponding to classical Khintchine inequality is replaced by general symmetric distributions. The proof…
In the first of this series of two articles, we studied some geometrical aspects of the Birkhoff polytope, the compact convex set of all $n \times n$ doubly stochastic matrices, namely the Chebyshev center, and the Chebyshev radius of the…
We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric…
In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…
In distributed optimization, the communication of model updates can be a performance bottleneck. Consequently, gradient compression has been proposed as a means of increasing optimization throughput. In general, due to information loss,…
We establish a Pythagorean theorem for the absolute values of the blocks of a partitioned matrix. This leads to a series of remarkable operator inequalities.