Related papers: On a Norm Compression Inequality for 2XN Partition…
Bernoulli-$p$ thinning has been well-studied for point processes. Here we consider three other cases: (1) sequences $(X_1,X_2,...)$; (2) gaps of such sequences $(X_{n+1}-X_1)_{n\in\mathbb{N}}$; (3) partition structures. For the first case…
We answer Totik's question on weighted Bernstein's inequalities showing that $$ \|T_n'\|_{L_p(\omega)} \le C(p,\omega)\, {n}\,\|T_n\|_{L_p(\omega)},\qquad 0<p\le \infty, $$ holds for all trigonometric polynomials $T_n$ and certain…
We characterize two-weight inequalities for certain maximal truncations of the Hilbert transform in terms of testing conditions on simpler functions. For 1<p<2 and two positive Borel measures u, v on R, we assume that u is doubling, and we…
Any square matrix can be transformed into a doubly stochastic matrix via Sinkhorn scaling with diagonal matrices or completing to a larger dimensional matrix. Standard Birkhoff-von Neumann and Pauli decompositions represent such matrices as…
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of…
The ubiquitous Variable-Byte encoding is one of the fastest compressed representation for integer sequences. However, its compression ratio is usually not competitive with other more sophisticated encoders, especially when the integers to…
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a well-designed sensing matrix can reduce the coherence between the…
Higher-order tensors are well-suited for representing multi-dimensional data, such as images and videos, which typically characterize low-rank structures. Low-rank tensor decomposition has become essential in machine learning and computer…
We characterize the weighted Hardy's inequalities for monotone functions in ${\mathbb R^n_+}.$ In dimension $n=1$, this recovers the classical theory of $B_p$ weights. For $n>1$, the result was only known for the case $p=1$. In fact, our…
In heavy nuclei there is a parametrical suppression, $\;\sim A^{-1/3}\;$, of T-odd, P-odd matrix elements as compared to T-even, P-odd ones.
We present some results concerning the $l^p$ norms of weighted mean matrices. These results can be regarded as analogues to a result of Bennett concerning weighted Carleman's inequalities.
We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…
We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…
We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…
Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices…
We consider the problem of distilling uniform random bits from an unknown source with a given $p$-entropy using linear hashing. As our main result, we estimate the expected $p$-divergence from the uniform distribution over the ensemble of…
In this paper, we study chance constrained mixed integer program with consideration of recourse decisions and their incurred cost, developed on a finite discrete scenario set. Through studying a non-traditional bilinear mixed integer…
Packing problems are an important class of optimization problems. The probably most well-known problem if this type is knapsack and many generalizations of it have been studied in the literature like Two-dimensional Geometric Knapsack…
Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational…
The most fundamental problem considered in algorithms for text processing is pattern matching: given a pattern $p$ of length $m$ and a text $t$ of length $n$, does $p$ occur in $t$? Multiple versions of this basic question have been…