English
Related papers

Related papers: Grokability in five inequalities

200 papers

Let $C\subseteq \{1,\ldots,k\}^n$ be such that for any $k$ distinct elements of $C$ there exists a coordinate where they all differ simultaneously. Fredman and Koml\'os studied upper and lower bounds on the largest cardinality of such a set…

Combinatorics · Mathematics 2020-02-26 Simone Costa , Marco Dalai

The concept of Gromov hyperbolicity manifests itself in many different ways. With only mild assumptions on the underlying metric space, the spectrum of equivalent properties includes various thin triangle conditions, the stability of…

Metric Geometry · Mathematics 2023-08-04 Tommaso Goldhirsch , Urs Lang

For $n$ positive numbers ($a_k$, $1\leq k \leq n$), enhanced inequalities about the arithmetic mean ($A_n \equiv \frac{\sum_ka_k}{n}$) and the geometric mean ($G_n\equiv \sqrt[n]{\Pi_ka_k}$) are found if some numbers are known, namely,…

General Mathematics · Mathematics 2020-08-11 Fang Dai , Li-Gang Xia

We prove new concentration estimates for random variables that are functionals of a Poisson measure defined on a general measure space. Our results are specifically adapted to geometric applications, and are based on a pervasive use of a…

Probability · Mathematics 2015-04-14 Sascha Bachmann , Giovanni Peccati

Comparing structured data from possibly different metric-measure spaces is a fundamental task in machine learning, with applications in, e.g., graph classification. The Gromov-Wasserstein (GW) discrepancy formulates a coupling between the…

Machine Learning · Computer Science 2022-07-12 Hongwei Jin , Zishun Yu , Xinhua Zhang

Introducing inequality constraints in Gaussian process (GP) models can lead to more realistic uncertainties in learning a great variety of real-world problems. We consider the finite-dimensional Gaussian approach from Maatouk and Bay (2017)…

Machine Learning · Statistics 2021-11-04 Andrés F. López-Lopera , François Bachoc , Nicolas Durrande , Olivier Roustant

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Computational Complexity · Computer Science 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

Grothendieck constants $K_G(d)$ bound the advantage of $d$-dimensional strategies over $1$-dimensional ones in a specific optimisation task. They have applications ranging from approximation algorithms to quantum nonlocality. However, apart…

Optimization and Control · Mathematics 2026-02-03 Sébastien Designolle , Tamás Vértesi , Sebastian Pokutta

In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…

Geometric Topology · Mathematics 2019-10-30 Meru Alagalingam

Gromov hyperbolic spaces have become an essential concept in geometry, topology and group theory. Here we extend Ancona's potential theory on Gromov hyperbolic manifolds and graphs of bounded geometry to a large class of Schr\"odinger…

Differential Geometry · Mathematics 2022-12-13 Matthias Kemper , Joachim Lohkamp

We generalize optimal inequalities of C. Loewner and M. Gromov, by proving lower bounds for the total volume in terms of the homotopy systole and the stable systole. Our main tool is the construction of an area-decreasing map to the Jacobi…

Differential Geometry · Mathematics 2007-05-23 Sergei V. Ivanov , Mikhail G. Katz

We provide a comprehensive study of the convergence of the forward-backward algorithm under suitable geometric conditions, such as conditioning or {\L}ojasiewicz properties. These geometrical notions are usually local by nature, and may…

Optimization and Control · Mathematics 2023-12-25 Guillaume Garrigos , Lorenzo Rosasco , Silvia Villa

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Metric Geometry · Mathematics 2022-07-12 Han Huang , Boaz A. Slomka , Tomasz Tkocz , Beatrice-Helen Vritsiou

In a 2013 paper, the author showed that the convolution of a compactly supported measure on the real line with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). In a 2014 paper, the author gave bounds for the optimal…

Functional Analysis · Mathematics 2014-12-05 David Zimmermann

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\mathbb{R}^m$ of $\ell_2$ norm at most $1$ and any convex body $K$ in $\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\pm 1$…

Data Structures and Algorithms · Computer Science 2017-08-04 Nikhil Bansal , Daniel Dadush , Shashwat Garg , Shachar Lovett

Our main result is an abstract good-$\lambda$ inequality that allows us to consider three self-improving properties related to oscillation estimates in a very general context. The novelty of our approach is that there is one principle…

Classical Analysis and ODEs · Mathematics 2018-10-10 Lauri Berkovits , Juha Kinnunen , José María Martell

We consider the complex case of the so-called S-inequality. It concerns the behaviour of the Gaussian measures of dilations of convex and rotationally symmetric sets in C^n (rotational symmetry is invariance under the multiplication by…

Probability · Mathematics 2011-01-13 Tomasz Tkocz

Gromov proved a cube inequality on the bound of distances between opposite faces of a cube equipped with a positive scalar curvature metric in dimension $\leq 8$ using minimal surface method. He conjectured that the cube inequality also…

Differential Geometry · Mathematics 2023-04-26 Jinmin Wang , Zhizhang Xie , Guoliang Yu

Let $r_k(N)$ denote the size of the largest subset of $[N] = \{1,\ldots,N\}$ with no $k$-term arithmetic progression. We show that for $k\ge 5$, there exists $c_k>0$ such that \[r_k(N)\ll N\exp(-(\log\log N)^{c_k}).\] Our proof is a…

Combinatorics · Mathematics 2024-03-01 James Leng , Ashwin Sah , Mehtaab Sawhney
‹ Prev 1 2 3 10 Next ›