121 research outputs found
John-type theorems for generalized arithmetic progressions and iterated sumsets
A classical theorem of Fritz John allows one to describe a convex body, up to
constants, as an ellipsoid. In this article we establish similar descriptions
for generalized (i.e. multidimensional) arithmetic progressions in terms of
proper (i.e. collision-free) generalized arithmetic progressions, in both
torsion-free and torsion settings. We also obtain a similar characterization of
iterated sumsets in arbitrary abelian groups in terms of progressions, thus
strengthening and extending recent results of Szemer\'edi and Vu.Comment: 20 pages, no figures, to appear, Adv. in Math. Some minor changes
thanks to referee repor
Locality in sumsets
Motivated by the Polynomial Freiman-Ruzsa (PFR) Conjecture, we develop a theory of locality in sumsets, with several applications to John-type approximation and stability of sets with small doubling. One highlight shows that if with is non-degenerate then is covered by translates of a -dimensional generalised arithmetic progression (-GAP) with ; thus we obtain one of the polynomial bounds required by PFR, under the non-degeneracy assumption that is not efficiently covered by translates of a -GAP. We also prove a stability result showing for any that if with is non-degenerate then some with is efficiently covered by either a -GAP or translates of a -GAP. This `dimension-free‘ bound for approximate covering makes for a surprising contrast with exact covering, where the required number of translates not only grows with , but does so exponentially. Another highlight shows that if is non-degenerate with and then is covered by translates of a -GAP with ; this is tight, in that cannot be replaced by any smaller number. The above results also hold for , replacing GAPs by a suitable common generalisation of GAPs and convex bodies, which we call generalised convex progressions. In this setting the non-degeneracy condition holds automatically, so we obtain essentially optimal bounds with no additional assumption on . Here we show that if satisfies with , then with so that . This is a dimensionally independent sharp stability result for the Brunn-Minkowski inequality for equal sets, which hints towards a possible analogue for the Prékopa-Leindler inequality. These results are all deduced from a unifying theory, in which we introduce a new intrinsic structural approximation of any set, which we call the `additive hull‘, and develop its theory via a refinement of Freiman‘s theorem with additional separation properties. A further application that will be published separately is a proof of Ruzsa‘s Discrete Brunn-Minkowski Conjecture \cite{Ruzsaconjecture}
Compressions, convex geometry and the Freiman-Bilu theorem
We note a link between combinatorial results of Bollob\'as and Leader
concerning sumsets in the grid, the Brunn-Minkowski theorem and a result of
Freiman and Bilu concerning the structure of sets of integers with small
doubling.
Our main result is the following. If eps > 0 and if A is a finite nonempty
subset of a torsion-free abelian group with |A + A| <= K|A|, then A may be
covered by exp(K^C) progressions of dimension [log_2 K + eps] and size at most
|A|.Comment: 9 pages, slight revisions in the light of comments from the referee.
To appear in Quarterly Journal of Mathematics, Oxfor
A result on the size of iterated sumsets in
In this paper we give a different approach to determining the cardinality of
-fold sumsets when has elements. This
enables us to provide more general result with a shorter and simpler proof. We
also obtain an upper bound for the value of when
is a set of elements with simplicial hull.Comment: It was noticed that the proof of the main Theorem could be improved
to give a more general result. Also some motivating examples are provide
The convexification effect of Minkowski summation
Let us define for a compact set the sequence It was independently proved by Shapley, Folkman and Starr (1969)
and by Emerson and Greenleaf (1969) that approaches the convex hull of
in the Hausdorff distance induced by the Euclidean norm as goes to
. We explore in this survey how exactly approaches the convex
hull of , and more generally, how a Minkowski sum of possibly different
compact sets approaches convexity, as measured by various indices of
non-convexity. The non-convexity indices considered include the Hausdorff
distance induced by any norm on , the volume deficit (the
difference of volumes), a non-convexity index introduced by Schneider (1975),
and the effective standard deviation or inner radius. After first clarifying
the interrelationships between these various indices of non-convexity, which
were previously either unknown or scattered in the literature, we show that the
volume deficit of does not monotonically decrease to 0 in dimension 12
or above, thus falsifying a conjecture of Bobkov et al. (2011), even though
their conjecture is proved to be true in dimension 1 and for certain sets
with special structure. On the other hand, Schneider's index possesses a strong
monotonicity property along the sequence , and both the Hausdorff
distance and effective standard deviation are eventually monotone (once
exceeds ). Along the way, we obtain new inequalities for the volume of the
Minkowski sum of compact sets, falsify a conjecture of Dyn and Farkhi (2004),
demonstrate applications of our results to combinatorial discrepancy theory,
and suggest some questions worthy of further investigation.Comment: 60 pages, 7 figures. v2: Title changed. v3: Added Section 7.2
resolving Dyn-Farkhi conjectur
Sets Characterized by Missing Sums and Differences in Dilating Polytopes
A sum-dominant set is a finite set of integers such that .
As a typical pair of elements contributes one sum and two differences, we
expect sum-dominant sets to be rare in some sense. In 2006, however, Martin and
O'Bryant showed that the proportion of sum-dominant subsets of
is bounded below by a positive constant as . Hegarty then extended
their work and showed that for any prescribed , the
proportion of subsets of that are missing
exactly sums in and exactly differences in
also remains positive in the limit.
We consider the following question: are such sets, characterized by their
sums and differences, similarly ubiquitous in higher dimensional spaces? We
generalize the integers in a growing interval to the lattice points in a
dilating polytope. Specifically, let be a polytope in with
vertices in , and let now denote the proportion of
subsets of that are missing exactly sums in and
exactly differences in . As it turns out, the geometry of
has a significant effect on the limiting behavior of . We define
a geometric characteristic of polytopes called local point symmetry, and show
that is bounded below by a positive constant as if
and only if is locally point symmetric. We further show that the proportion
of subsets in that are missing exactly sums and at least
differences remains positive in the limit, independent of the geometry of .
A direct corollary of these results is that if is additionally point
symmetric, the proportion of sum-dominant subsets of also remains
positive in the limit.Comment: Version 1.1, 23 pages, 7 pages, fixed some typo
Sumsets and Veronese varieties
In this paper, to any subset we explicitly associate a unique monomial projection of a Veronese variety, whose Hilbert function coincides with the cardinality of the -fold sumsets . This link allows us to tackle the classical problem of determining the polynomial such that for all and the minimum integer for which this condition is satisfied, i.e. the so-called phase transition of . We use the Castelnuovo-Mumford regularity and the geometry of to describe the polynomial and to derive new bounds for under some technical assumptions on the convex hull of ; and vice versa we apply the theory of sumsets to obtain geometric information of the varieties
- …