相关论文: Multiplicatively badly approximable matrices up to…

Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ones not different…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let $A$ be an $n\times n$ random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at…

We show that if $\frac{L}{\varphi(q)\log X}\to\infty$ as $X\to\infty$, almost all $(a, x)\in (\mathbb Z/q\mathbb Z)^\times\times [X, 2X]$ are such that there exists a product of at most two primes in $[x, x + L]$ congruent to $a\mod{q}$.

We develop a novel connection between discrepancy minimization and (quantum) communication complexity. As an application, we resolve a substantial special case of the Matrix Spencer conjecture. In particular, we show that for every…

A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Let $A_1, \ldots, A_r$ be Hermitian $n \times n$ matrices and $S = \sum A_i \otimes s_i$ the associated matrix semicircle, where $s_1, \ldots, s_r$ are free semicircular variables. We prove that the following are equivalent: (i) the matrix…

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Let $A$ and $ B$ be $n\times n$ positive definite complex matrices, let $\sigma$ be a matrix mean, and let $f : [0,\infty)\to [0,\infty)$ be a differentiable convex function with $f(0)=0$. We prove that $$f^{\prime}(0)(A \sigma B)\leq…

We study the almost sure convergence of the normalized columns in an infinite product of nonnegative matrices, and the almost sure rank one property of its limit points. Given a probability on the set of $2\times2$ nonnegative matrices,…

The classical Reed-Muller codes over a finite field $\mathbb{F}_q$ are based on evaluations of $m$-variate polynomials of degree at most $d$ over a product set $U^m$, for some $d$ less than $|U|$. Because of their good distance properties,…

The aim of this paper is to present new upper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the…

We study the time complexity of computing the $(\min,+)$ matrix product of two $n\times n$ integer matrices in terms of $n$ and the number of monotone subsequences the rows of the first matrix and the columns of the second matrix can be…

We investigate the problem of the existence of a density matrix rho on the product of three Hilbert spaces with given marginals on the pair (1,2) and the pair (2,3). While we do not solve this problem completely we offer partial results in…

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

Given a redundant dictionary $\Phi$, represented by an $M \times N$ matrix ($\Phi \in \mathbb{R}^{M \times N}$) and a target signal $y \in \mathbb{R}^M$, the \emph{sparse approximation problem} asks to find an approximate representation of…

We study the singular values (and Lyapunov exponents) for products of $N$ independent $n\times n$ random matrices with i.i.d. entries. Such matrix products have been extensively analyzed using free probability, which applies when $n\to…