Related papers: Grokability in five inequalities

We prove an asymptotic analog of the classical Hurewicz theorem on mappings which lower dimension. This theorem allows us to find sharp upper bound estimates for the asymptotic dimension of groups acting on finite dimensional metric spaces…

We extend results known for the randomized Gauss-Seidel and the Gauss-Southwell methods for the case of a Hermitian and positive definite matrix to certain classes of non-Hermitian matrices. We obtain convergence results for a whole range…

We extend to n-dimensions a characterization of the Marcinkiewicz $L(p,\infty)$ spaces first obtained by Garsia-Rodemich in the one dimensional case. This leads to a new proof of the John-Nirenberg self-improving inequalities. We also show…

We give a new proof of an isoperimetric inequality for a family of closed surfaces, which have Gaussian curvature identically equal to one wherever the surface is smooth. These surfaces are formed from a convex, spherical polygon, with each…

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…

In a symmetric space of noncompact type X = G/K oriented geodesic segments correspond to points in the Euclidean Weyl chamber. We can hence assign vector-valued side-lengths to segments. Our main result is a system of homogeneous linear…

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

This note, mostly expository, is devoted to Poincar{\'e} and log-Sobolev inequalities for a class of Boltzmann-Gibbs measures with singular interaction. Such measures allow to model one-dimensional particles with confinement and singular…

Let $1\leq i \leq k < n$ be integers. We prove the following exact inequalities for any convex body $K\subset\mathbb{R}^n$ with centroid at the origin, and any $k$-dimensional subspace $E\subset \mathbb{R}^n$: \begin{align*} &V_i \big(…

The Horndeski gauge-gravity coupling is the leading non-minimal interaction between gravity and gauge bosons, and it preserves all the symmetries and the number of physical degrees of freedom of the standard model of particle physics and…

We consider a compound testing problem within the Gaussian sequence model in which the null and alternative are specified by a pair of closed, convex cones. Such cone testing problem arise in various applications, including detection of…

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

We study the query complexity of geodesically convex (g-convex) optimization on a manifold. To isolate the effect of that manifold's curvature, we primarily focus on hyperbolic spaces. In a variety of settings (smooth or not; strongly…

In a recent paper A. Cianchi, N. Fusco, F. Maggi, and A. Pratelli have shown that, in the Gauss space, a set of given measure and almost minimal Gauss boundary measure is necessarily close to be a half-space. Using only geometric tools, we…

Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. Let $\lambda_{\rm e}(G)$ be the smallest number of edges that can be removed from…

Let $G$ be a connected graph on $n$ vertices. The Gallai number $Gal(G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$. Gr\"unbaum constructed a graph $G$ with $Gal(G)=3$. Very recently, Long,…

We show that the convolution of a compactly supported measure on $\mathbb{R}$ with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). We use this result to give a new proof of a classical result in random matrix theory…