In the past few years, there are 137 papers with the term ‘sumset’ in its title; and 50 more with ‘sum-set’. Ok the above statement was stolen from a talk I happen to be sitting in, by Noga Alon.
As usual, in the middle of the talk I got carried away by some ‘trivial facts’ he wrote down which are only slightly related to the main content. So I thought about that for during the rest of the talk (and also a little bit afterwards).
This time the curious point pops up when he was motivating why people should be studying chromatic number of random Cayley graphs by its application to sumsets.
Definition: In a vector space , a sumset is a set that can be represented as the Minkowski sum of another set with itself. i.e. where .
It was mentioned that given a large , if we look at sets in , then all sets with large cardinality must be sumsets.
This fact is first published by Ben Green who also raised the natural question:
Question: What’s the lower bound such that all subsets with must be a sumset?
Let’s first see why all sets of large cardinality must be sumsets: Well as we all know (can also be expressed as many other sums) is a sumset. Hence the first non-trivial case is :
The way I think of sumsets is that they are projections of product sets in the angle :
Hence our goal is to make up a set such that the projection, after mod , is everything except for the point . Well, this isn’t too hard, first note the image of the ‘interval’ after mod is exactly the set we wanted. Now we just need to make project to the interval! will do. (Here by we meant that it’s the integer when is even and when it’s odd.
Note that since , is actually a square in and only “warped” in mod after we project it to .
So we just showed all sets with one missing element is a sumset~ Now let’s move to sets of size …(Don’t worry, I’m not going on to 3 and the length of this post will be finite :-P)
In contrast to the above argument which actually works in the continuous setting and shows the Lie group missing any interval is a sumset, this time we actually need to use the fact that our space is discrete and finite.
Note first that the property of being a sumset is invariant under scaling and translating by an integer. Indeed,
and of course .
Now no matter which two points we delete, i.e. , we may let . We have , which is the projection of the square .
Hence is a sumset.
After playing around with the torus for a little bit, I believe in the continue case we can still write deleting two (small) intervals as a sumset where is a union of no more than 4 intervals. There are quite a few cases involved concerning the spacing between small intervals, hence I’ll just draw an example:
(By the way, this is about as far as I got daydreaming during the lecture, the rest came from the sources I looked up afterwards.)
Unfortunately since the scaling and translating gived only two degrees of freedom, the above argument fails when considering sets missing three points. (Playing with torus as I first tried, however, might still work)
Back to our question, so now we know at least the natural thing to study is of course how does it grow with . Recall that we denoted , hence the problem is equivalent to giving asymptotic lower bounds for .
So this is quite curious, what do you think? Is just a counstant? (such as , or ?) Or is it always more than a fixed proportion of ? (say any set containing 99% of the elements must be a sumset?) Or something in-between?
As one might have expected, is more than a constant,
Theorem: (Green) .
It’s also not as large as a fixed percentage:
So it’s something ‘in-between’. Interesting…So what is this number? This is an open question in general, by applying methods of Cayley graphs and their spectrums, the speaker (of the talk) was able to improve the above bounds (in this other paper):
However one should expect that
Conjecture: (Green) .
Having knowing absolutely nothing about the subject (or combinatorics in general), my first reaction about this is that perhaps, if we look at where is roughly , let be the set missing equally spaced points, now if we want to write as a sumset that’s like finding a product that misses all diagonal circles and have at least points in each thin strip to ‘block’ every diagonal circle in the strip.
I think this set looks (by the same philosophy as when we play around with the two intervals on the tori case) fairly hard to express as a sum. i.e. when we are exactly in , we can probably ‘just’ do it by choosing one representative from each mod class and place them in the strips. But looks as if the ‘resolution’ is any lower, (i.e. is a little smaller and we still have about equally spaced holes), we would not have enough freedom to place the points.
Anyways, that last remark might be completely nonsense~ The conjecture is interesting, tho.