Related papers: Grokability in five inequalities

In this paper, we prove the uniform estimates for the resolvent $(\Delta - \alpha)^{-1}$ as a map from $L^q$ to $L^{q'}$ on real hyperbolic space $\mathbb{H}^n$ where $\alpha \in \mathbb{C}\setminus [(n - 1)^2/4, \infty)$ and $2n/(n + 2)…

We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique…

For a connected graph $G$ with order $n$ and an integer $k\geq 1$, we denote by $$S_k(D(G))=\lambda_1(D(G))+\cdots+\lambda_k(D(G))$$ the sum of $k$ largest distance eigenvalues of $G$. In this paper, we consider the sharp upper bound and…

We consider minimizing a smooth function subject to a summation constraint over its variables. By exploiting a connection between the greedy 2-coordinate update for this problem and equality-constrained steepest descent in the 1-norm, we…

This paper explores the use of "generated sets" $\{ \{ k \boldsymbol{\zeta} \} : k = 1, \ldots, n \}$ for function approximation in reproducing kernel Hilbert spaces which consist of multi-dimensional functions with an absolutely convergent…

We study fine P\'olya-Szeg\H{o} rearrangement inequalities into weighted intervals for Sobolev functions and functions of bounded variation defined on metric measure spaces supporting an isoperimetric inequality. We then specialize this…

We give two results about Harnack type inequalities. First, on compact smooth Riemannian surface without boundary, we have an estimate of the type $\sup +\inf$. The second result concerns the solutions of prescribed scalar curvature…

This paper considers the \textit{Zarankiewicz problem} in graphs with low-dimensional geometric representation (i.e., low Ferrers dimension). Our first result reveals a separation between bipartite graphs of Ferrers dimension three and…

We describe a general technique that yields the first {\em Statistical Query lower bounds} for a range of fundamental high-dimensional learning problems involving Gaussian distributions. Our main results are for the problems of (1) learning…

Let X be an arithmetic hyperbolic surface, \psi a Hecke-Maass form, and l a geodesic segment on X. We obtain a power saving over the local bound of Burq-G\'erard-Tzvetkov for the L^2 norm of \psi restricted to l, by extending the technique…

We derive first-order (in the stepsize) bounds on the bias in Wasserstein distances of the invariant measure of stochastic gradient kinetic Langevin dynamics with minimal assumptions on the stochastic gradient noise. These bounds sharpen…

We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness. Our novel analysis also uncovers previously unknown connections between the low rank…

The aim of this paper is to establish various functional inequalities for the convolution of a compactly supported measure and a standard Gaussian distribution on Rd. We especially focus on getting good dependence of the constants on the…

We study the cases of equality and prove a rigidity theorem concerning the 1-Bakry-\'Emery inequality. As an application, we prove the rigidity of the Gaussian isoperimetric inequality, the logarithmic Sobolev inequality and the Poincar\'e…

We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.

Let $n$ be an integer with $3 \leq n \leq 7$, and let $g$ be a Riemannian metric on $B^2 \times T^{n-2}$ with scalar curvature at least $-n(n-1)$. We establish an inequality relating the systole of the boundary to the infimum of the mean…

Counterexamples to some old-standing optimization problems in the smooth convex coercive setting are provided. We show that block-coordinate, steepest descent with exact search or Bregman descent methods do not generally converge. Other…

Let $A, B$, be finite subsets of an abelian group, and let $G \subset A \times B$ be such that $# A, # B, # \{a+b: (a,b) \in G \} \leq N$. We consider the question of estimating the quantity $# \{a-b: (a,b) \in G \}$. Recently Bourgain…

In this paper, we establish improved effective irrationality measures for certain numbers of the form $\sqrt[3]{n}$, using approximations obtained from hypergeometric functions. These results are very close to the best possible using this…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…