Related papers: Tight Bounds for Consensus Systems Convergence
We show that defect modes in infinite systems of resonators have corresponding modes in finite systems which converge as the size of the system increases. We study the generalized capacitance matrix as a model for three-dimensional coupled…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
We formulate conjectures regarding the maximum value and maximizing matrices of the permanent and of diagonal products on the set of stochastic matrices with bounded rank. We formulate equivalent conjectures on upper bounds for these…
We show that tensor products of $k$ gradients of harmonic functions, with $k$ at least three, are dense in $C(\overline{\Omega})$, for any bounded domain $\Omega$ in dimension 3 or higher. The bulk of the argument consists in showing that…
This paper develops nonasymptotic growth and concentration bounds for a product of independent random matrices. These results sharpen and generalize recent work of Henriksen-Ward, and they are similar in spirit to the results of…
Let $\mathcal{S}$ be the set of all positive-definite, symmetrizable integer matrices with non-zero upper and lower diagonal and $\mathcal{T}$ to be the set of all positive-definite real symmetric matrices with nonzero upper diagonal such…
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…
This paper studies the matrix Moment-SOS hierarchy for solving polynomial matrix optimization. Our first result is to show the finite convergence of this hierarchy, if the nondegeneracy condition, strict complementarity condition and second…
Let $\Psi_n$ be a product of $n$ independent, identically distributed random matrices $M$, with the properties that $\Psi_n$ is bounded in $n$, and that $M$ has a deterministic (constant) invariant vector. Assuming that the probability of…
We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…
The study of matroid products traces back to the 1970s, when Lov\'asz and Mason studied the existence of various types of matroid products with different strengths. Among these, the tensor product is arguably the most important, which can…
We prove a strong form of the equivalence of ensembles for the invariant measures of zero range processes conditioned to a supercritical density of particles. It is known that in this case there is a single site that accomodates a…
For a Markov semigroup $P_t$ with invariant probability measure $\mu$, a constant $\ll>0$ is called a lower bound of the ultra-exponential convergence rate of $P_t$ to $\mu$, if there exists a constant $C\in (0,\infty)$ such that $$…
We consider a one-dimensional totally asymmetric nearest-neighbor zero-range process with site-dependent jump-rates - an environment. For each environment p we prove that the set of all invariant measures is the convex hull of a set of…
Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…
We consider the problem of approximating numerically the moments and the supports of measures which are invariant with respect to the dynamics of continuous- and discrete-time polynomial systems, under semialgebraic set constraints. First,…
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…
We study the problem of approximating a matrix $\mathbf{A}$ with a matrix that has a fixed sparsity pattern (e.g., diagonal, banded, etc.), when $\mathbf{A}$ is accessed only by matrix-vector products. We describe a simple randomized…
A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…
We study the totally asymmetric exclusion process on the positive integers with a single particle source at the origin. Liggett (1975) has shown that the long term behaviour of this process has a phase transition: If the particle production…