Related papers: The random paving property for uniformly bounded m…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
We show how different random thin sets of integers may have different behaviour. First, using a recent deviation inequality of Boucheron, Lugosi and Massart, we give a simpler proof of one of our results in {\sl Some new thin sets of…
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…
We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the Monge-Amp{\`e}re equation, which is based on the maximum…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…
A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…
In the first part of this paper we generalize the result of Georgiou-Pavon that a positive square matrix can be scaled uniquely to a column stochastic matrix which maps a given positive probability vector to another given positive…
Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…
The NP-hard Minimum Common String Partition problem asks whether two strings $x$ and $y$ can each be partitioned into at most $k$ substrings, called blocks, such that both partitions use exactly the same blocks in a different order. We…
For positive semi-definite block-matrix $M,$ we say that $M$ is P.S.D. and we write $M=\begin{pmatrix} A \& X\\ {X^*} \& B\end{pmatrix} \in {\mathbb{M}}\_{n+m}^+$, with $A\in {\mathbb{M}}\_n^+$, $B \in {\mathbb{M}}\_m^+.$ The focus is on…
We prove a quantitative version of a Silverstein's Theorem on a condition for convergence in probability of the norm of random matrix. More precisely, we show that for a random matrix whose entries are i.i.d. random variables, $w_{i,j}$,…
Raimi's classical theorem establishes a partition of the natural numbers with a remarkable unavoidability property: for every finite coloring of $\mathbb{N}$, there is a color class whose translate meets both parts of the partition in…
Grover's algorithm is one of the most famous algorithms which explicitly demonstrates how the quantum nature can be utilized to accelerate the searching process. In this work, Grover's quantum search problem is mapped to a time-optimal…
Can the behavior of a random matrix be improved by modifying a small fraction of its entries? Consider a random matrix $A$ with i.i.d. entries. We show that the operator norm of $A$ can be reduced to the optimal order $O(\sqrt{n})$ by…
In this paper, we propose a probabilistic approach to the study of the characteristic polynomial of a random unitary matrix. We recover the Mellin Fourier transform of such a random polynomial, first obtained by Keating and Snaith, using a…
We give a new proof of the Caffarelli contraction theorem, which states that the Brenier optimal transport map sending the standard Gaussian measure onto a uniformly log-concave probability measure is Lipschitz. The proof combines a recent…
We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…
Let $A$ be a positive semidefinite matrix, block partitioned as $$ A=\twomat{B}{C}{C^*}{D}, $$ where $B$ and $D$ are square blocks. We prove the following inequalities for the Schatten $q$-norm $||.||_q$, which are sharp when the blocks are…
In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…