English
Related papers

Related papers: The hamburger theorem

200 papers

A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.

Combinatorics · Mathematics 2019-02-18 Andrzej P. Kisielewicz , Krzysztof Przesławski

Let L be a finite extension of Q_p and d a positive integer. A conjecture, due to C. Breuil and P. Schneider, says that the existence of invariant norms on certain locally algebraic representations of GL_{d+1}(L) should be equivalent to the…

Number Theory · Mathematics 2009-09-04 Yongquan Hu

We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…

Combinatorics · Mathematics 2011-07-05 Henry Towsner

A result of Rosenthal says that for every $q>1$ and $n \in \mathbb{N}$ there is $N \in \mathbb{N}$ such that every sequence of $N$ distinct positive numbers contains, after a suitable translation and possible multiplication by $-1$, a…

Combinatorics · Mathematics 2018-05-21 Attila Por

A graph $G$ is $m$-minor-universal if every graph with at most $m$ edges (and no isolated vertices) is a minor of $G$. We prove that the $d$-dimensional hypercube, $Q_d$, is $\Omega\left(\frac{2^d}{d}\right)$-minor-universal, and that there…

Combinatorics · Mathematics 2025-02-11 Itai Benjamini , Or Kalifa , Elad Tzalik

A theorem of Bourgain states that the harmonic measure for a domain in $\R^d$ is supported on a set of Hausdorff dimension strictly less than $d$ \cite{Bourgain}. We apply Bourgain's method to the discrete case, i.e., to the distribution of…

Probability · Mathematics 2007-05-23 E. Bolthausen , K. Muench-Berndl

It was proved in 1998 by Ben-David and Litman that a concept space has a sample compression scheme of size d if and only if every finite subspace has a sample compression scheme of size d. In the compactness theorem, measurability of the…

Machine Learning · Statistics 2015-03-20 Damjan Kalajdzievski

For given simple graphs $H_1,H_2,\dots,H_c$, the multicolor Ramsey number $R(H_1,H_2,\dots,H_c)$ is defined as the smallest positive integer $n$ such that for an arbitrary edge-decomposition $\{G_i\}^c_{i=1}$ of the complete graph $K_n$, at…

Combinatorics · Mathematics 2023-08-22 Xuejun Zhang , Xinmin Hou

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

Combinatorics · Mathematics 2012-12-03 Henry Towsner

In this paper we consider the analytic continuation of the weighted Bergman spaces on the Lie ball $$\mathscr{D}=SO(2,n)/S(O(2) \times O(n))$$ and the corresponding holomorphic unitary (projective) representations of SO(2,n) on these…

Representation Theory · Mathematics 2009-07-02 Henrik Seppanen

Let $G$ be a connected compact group equipped with the normalised Haar measure $\mu$. Our first result shows that given $\alpha, \beta>0$, there is a constant $c = c(\alpha,\beta)>0$ such that for any compact sets $A,B\subseteq G$ with $…

Combinatorics · Mathematics 2023-07-12 Yifan Jing , Akshat Mudgal

We introduce and prove the $n$-dimensional Pizza Theorem: Let $\mathcal{H}$ be a hyperplane arrangement in $\mathbb{R}^{n}$. If $K$ is a measurable set of finite volume, the {pizza quantity} of $K$ is the alternating sum of the volumes of…

Combinatorics · Mathematics 2022-02-11 Richard Ehrenborg , Sophie Morel , Margaret Readdy

This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d. We investigate lower and upper bounds on the maximum (weak and…

Combinatorics · Mathematics 2014-12-01 Carl Georg Heise , Konstantinos Panagiotou , Oleg Pikhurko , Anusch Taraz

Let H(f)(x)=\int_{(0,infty)^d} f(v) E_{x}(v) d\nu(v), be the multivariable Hankel transform, where E_{x}(v)=\prod_{k=1}^d (x_k v_k)^{-a_k+1/2} J_{a_k-1/2}(x_k v_k), d\nu(v)=v^a dv, a=(a_1,...,a_d). We give sufficient conditions on a bounded…

Functional Analysis · Mathematics 2011-12-20 Jacek Dziubański , Marcin Preisner , Błażej Wróbel

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

Consider partitions, of a cardinality $(q-1)(d+1)+1$ generic subset of euclidean $d$-space, into $q$ parts whose convex hulls have a nonempty intersection. We show that if these partitions are counted with appropriate signs $\pm 1$ then the…

Combinatorics · Mathematics 2009-09-25 K. S. Sarkaria

For an $r$-uniform hypergraph $H$, let $\nu^{(m)}(H)$ denote the maximum size of a set~$M$ of edges in $H$ such that every two edges in $M$ intersect in less than $m$ vertices, and let $\tau^{(m)}(H)$ denote the minimum size of a collection…

Combinatorics · Mathematics 2022-10-25 Abdul Basit , Daniel McGinnis , Henry Simmons , Matt Sinnwell , Shira Zerbib

Stein proposed the following conjecture: if the edge set of $K_{n,n}$ is partitioned into $n$ sets, each of size $n$, then there is a partial rainbow matching of size $n-1$. He proved that there is a partial rainbow matching of size…

Combinatorics · Mathematics 2016-05-09 Ron Aharoni , Eli Berger , Dani Kotlar , Ran Ziv

In this paper we are concerned with the space of tempered ultrahyperfunctions corresponding to a proper open convex cone. A holomorphic extension theorem (the version of the celebrated edge of the wedge theorem) will be given for this…

Functional Analysis · Mathematics 2009-10-28 Daniel H. T. Franco

We show that any $d$-colored set of points in general position in $\mathbb{R}^d$ can be partitioned into $n$ subsets with disjoint convex hulls such that the set of points and all color classes are partitioned as evenly as possible. This…

Combinatorics · Mathematics 2019-04-04 Pavle V. M. Blagojević , Günter Rote , Johanna K. Steinmeyer , Günter M. Ziegler
‹ Prev 1 8 9 10 Next ›