相关论文: On a Norm Compression Inequality for 2XN Partition…

We study metric projections onto cones in the Wasserstein space of probability measures, defined by stochastic orders. Dualities for backward and forward projections are established under general conditions. Dual optimal solutions and their…

The aim of this article is to give a complete solution to the problem of the bilinear decompositions of the products of some Hardy spaces $H^p(\mathbb{R}^n)$ and their duals in the case when $p<1$ and near to $1$, via wavelets, paraproducts…

We convert a conjectured inequality from quantum information theory, due to He and Vidal, into a block matrix inequality and prove a special case. Given $n$ matrices $A_i$, $i=1,\ldots,n$, of the same size, let $Z_1$ and $Z_2$ be the block…

Given an $n \times d$ matrix $A$, its Schatten-$p$ norm, $p \geq 1$, is defined as $\|A\|_p = \left (\sum_{i=1}^{\textrm{rank}(A)}\sigma_i(A)^p \right )^{1/p}$, where $\sigma_i(A)$ is the $i$-th largest singular value of $A$. These norms…

We address some theoretical guarantees for Schatten-$p$ quasi-norm minimization ($p \in (0,1]$) in recovering low-rank matrices from compressed linear measurements. Firstly, using null space properties of the measurement operator, we…

Given a matrix $\mathbf{A} \in \mathbb{R}^{k \times n}$, a partitioning of $[k]$ into groups $S_1,\dots,S_m$, an outer norm $p$, and a collection of inner norms such that either $p \ge 1$ and $p_1,\dots,p_m \ge 2$ or $p_1=\dots=p_m=p \ge…

With the deployment of neural networks on mobile devices and the necessity of transmitting neural networks over limited or expensive channels, the file size of the trained model was identified as bottleneck. In this paper, we propose a…

In a recent paper, Brusco, K\"ohn and Steinley [Ann. Oper. Res. 206:611-626 (2013)] conjecture that the 2 bins special case of the one-dimensional minimax bin-packing problem with bin size constraints might be solvable in polynomial time.…

We exhibit large classes of contractions on noncommutative $L^p$-spaces which satisfy the noncommutative analogue of Matsaev's conjecture, introduced by Peller, in 1985. In particular, we prove that every Schur multiplier on a Schatten…

In this paper we present a rare combination of abstract results on the spectral properties of slanted matrices and some of their very specific applications to frame theory and sampling problems. We show that for a large class of slanted…

We consider the effect of a partial transpose on the limit $*$-distribution of a Haar distributed random unitary matrix. If we fix, $b$, the number of blocks, we show that the partial transpose can be decomposed into a sum of $b$ matrices…

In this paper, we fully characterize the duality mapping over the space of matrices that are equipped with Schatten norms. Our approach is based on the analysis of the saturation of the H\"older inequality for Schatten norms. We prove in…

In this article, we present several inequalities treating operator means and the Cauchy-Schwarz inequality. In particular, we present some new comparisons between operator Heron and Heinz means, several generalizations of the difference…

Some rearrangement inequalities for symmetric norms on matrices are given as well as related results for operator convex functions.

Compression aims to reduce the size of an input, while maintaining its relevant properties. For multi-parameter persistent homology, compression is a necessary step in any computational pipeline, since standard constructions lead to large…

Hankel tensors are generalizations of Hankel matrices. This article studies the relations among various ranks of Hankel tensors. We give an algorithm that can compute the Vandermonde ranks and decompositions for all Hankel tensors. For a…

We prove that any two-dimensional real subspace of Schatten-3 can be linearly isometrically embedded into $L_{3}$. This resolves the case $p = 3$ of Hanner's inequality for Schatten classes, conjectured by Ball, Carlen and Lieb. We…

A result of Dadarlat shows that nonzero even rational cohomology obstructs the matricial stability of many discrete groups. In the author's previous work, 2-cohomology is used to argue that certain groups are not stable in unnormalized…

Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of 3/2 and the time order…

Recently, we presented a new Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generalization of the Bin Packing Problem and 2-D…