1 citations · 1 across the 7 of their papers we have counts for
14 papers
Sharp Quantitative Stability for the Prékopa-Leindler and Borell-Brascamp-Lieb Inequalities
Alessio Figalli, Peter van Hintum, Marius Tiba
The Borell-Brascamp-Lieb inequality is a classical extension of the Prékopa-Leindler inequality, which in turn is a functional counterpart of the Brunn-Minkowski inequality. The st…
Intersections of iterated shadows
Hou Tin Chau, David Ellis, Marius Tiba
We show that if with measure bounded away from zero and from one, then the -iterated upper shadows of and $\mathc…
Erdős covering systems
Paul Balister, Béla Bollobás, Robert Morris +2
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erdős in 1950, and over the foll…
Large sumsets from small subsets
Bela Bollobas, Imre Leader, Marius Tiba
In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B f…
A strengthening of Freiman's 3k-4 theorem
Bela Bollobas, Imre Leader, Marius Tiba
In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmeti…
Radius, Girth and Minimum Degree
Vojtěch Dvořák, Peter van Hintum, Amy Shaw +1
Given a connected graph on vertices, with minimum degree and girth at least , what is the maximum radius this graph can have? Erdős, Pach, Pollack a…