Zobrazeno 1 - 10
of 88
pro vyhledávání: '"Tiba, Marius"'
Autor:
Balister, Paul, Bollobás, Béla, Campos, Marcelo, Griffiths, Simon, Hurley, Eoin, Morris, Robert, Sahasrabudhe, Julian, Tiba, Marius
The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$, that $$R_
Externí odkaz:
http://arxiv.org/abs/2410.17197
We show that if $\mathcal{A} \subset {[n] \choose n/2}$ with measure bounded away from zero and from one, then the $\Omega(\sqrt{n})$-iterated upper shadows of $\mathcal{A}$ and $\mathcal{A}^c$ intersect in a set of positive measure. This confirms (i
Externí odkaz:
http://arxiv.org/abs/2409.05487
The Brunn-Minkowski inequality, applicable to bounded measurable sets $A$ and $B$ in $\mathbb{R}^d$, states that $|A+B|^{1/d} \geq |A|^{1/d}+|B|^{1/d}$. Equality is achieved if and only if $A$ and $B$ are convex and homothetic sets in $\mathbb{R}^d$.
Externí odkaz:
http://arxiv.org/abs/2407.10932
The Brunn-Minkowski inequality states that for bounded measurable sets $A$ and $B$ in $\mathbb{R}^n$, we have $|A+B|^{1/n} \geq |A|^{1/n}+|B|^{1/n}$. Also, equality holds if and only if $A$ and $B$ are convex and homothetic sets in $\mathbb{R}^d$. Th
Externí odkaz:
http://arxiv.org/abs/2310.20643
Suppose that $A$ and $B$ are sets in $\mathbb{R}^d$, and we form the sumset of $A$ with $n$ random points of $B$. Given the volumes of $A$ and $B$, how should we choose them to minimize the expected volume of this sumset? Our aim in this paper is to
Externí odkaz:
http://arxiv.org/abs/2309.00103
We prove a conjecture by Ruzsa from 2006 on a discrete version of the Brunn-Minkowski inequality, stating that for any $A,B\subset\mathbb{Z}^k$ and $\epsilon>0$ with $B$ not contained in $n_{k,\epsilon}$ parallel hyperplanes we have $|A+B|^{1/k}\geq
Externí odkaz:
http://arxiv.org/abs/2306.13225
Publikováno v:
Acta Mathematica Hungarica, 161 (2020), 540-549
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\H{o}s in 1950, and over the following decades he asked many questions about them. Most famously, h
Externí odkaz:
http://arxiv.org/abs/2211.01417
In 1957, Hadwiger conjectured that every convex body in $\mathbb{R}^d$ can be covered by $2^d$ translates of its interior. For over 60 years, the best known bound was of the form $O(4^d \sqrt{d} \log d)$, but this was recently improved by a factor of
Externí odkaz:
http://arxiv.org/abs/2206.11227
The classical Cauchy--Davenport inequality gives a lower bound for the size of the sum of two subsets of ${\mathbb Z}_p$, where $p$ is a prime. Our main aim in this paper is to prove a considerable strengthening of this inequality, where we take only
Externí odkaz:
http://arxiv.org/abs/2206.09366
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 arithmetic progressions. Our aim in this paper is to strengthen this by allowin
Externí odkaz:
http://arxiv.org/abs/2204.09816