The polymath blog

February 13, 2011

Can Bourgain’s argument be usefully modified?

Filed under: Improving Roth bounds — gowers @ 6:23 pm

I’ve been feeling slightly guilty over the last few days because I’ve been thinking privately about the problem of improving the Roth bounds. However, the kinds of things I was thinking about felt somehow easier to do on my own, and my plan was always to go public if I had any idea that was a recognisable advance on the problem.

I’m sorry to say that the converse is false: I am going public, but as far as I know I haven’t made any sort of advance. Nevertheless, my musings have thrown up some questions that other people might like to comment on or think about.

Two more quick remarks before I get on to any mathematics. The first is that I still think it is important to have as complete a record of our thought processes as is reasonable. So I typed mine into a file as I was having them, and the file is available here to anyone who might be interested. The rest of this post will be a sort of digest of the contents of that file. The second remark is that I am writing this as a post rather than a comment because it feels to me as though it is the beginning of a strand of discussion rather than the continuation of one, though it grows out of some of the comments made on the last post. Note that since we are operating on the Polymath blog, anybody else is free to write a post too (if you are likely to be one of the main contributors, haven’t got moderator status and want it, get in touch and I can organize it).

The starting point for this line of thought is that the main difficulty we face seems to be that Bourgain’s Bohr-sets approach to Roth is in a sense the obvious translation of Meshulam’s argument, but because we have to make a width sacrifice at each iteration it gives a (\log N)^{-1/2} type bound rather than a (\log N)^{-1} type bound. Sanders’s argument gives a (\log N)^{-1} type bound, but if we use that then it is no longer clear how to import the new ideas of Bateman and Katz. Therefore, peculiar as it might seem to jettison one of the two papers that made this project seem like a good one in the first place, it is surely worth thinking about whether the width sacrifice that Bourgain makes (and that is also made in subsequent refinements of Bourgain’s method, due to Bourgain and Sanders) is fundamentally necessary or merely hard to avoid.

After thinking about this question in somewhat vague terms for quite a while, I have now reached a more precise formulation of it. To begin with, I want to avoid the technical issue of regularity, which can be thought of as arising from the fact that a lattice is a discrete set and therefore behaves a little strangely at small distance scales. We sort of know that that creates only technical difficulties, so if we want to get a feel for what is true, then it is convenient to think of a Bohr set as being a symmetric convex body in \mathbb{R}^d for some d.

The question I want to consider is this. Let B be a convex body in \mathbb{R}^d, let \epsilon>0, and let A be a subset of B of relative density \alpha that contains no 3AP with common difference of length greater than \epsilon. (This last condition is needed, since every set of positive measure contains a non-trivial 3AP, by the Lebesgue density theorem. It can be thought of as admitting that our set-up isn’t really continuous but just looks continuous at an appropriate distance scale.) Is it possible to show that there is a density increase of around \alpha^2 on a structured subset of B of comparable width?

Actually, what I really want is (I think — I haven’t checked this formulation as carefully as I should have) a trigonometric function \tau(x)=e(x.y) such that |\langle \mu_B(\alpha-1_A),\tau\rangle|\geq c\alpha^2 for some absolute constant c>0. The reason this would be nice is that we could then pass to a subset B' of B on which A would have increased density, and the width of B' would be comparable to that of B. The set B' would no longer be convex: it would look more like a union of parallel slabs cut out of B. But it would be Freiman isomorphic to something like a “convex body” in \mathbb{R}^d\times\mathbb{Z}. Going back to Bohr sets, we ought to have no trouble getting from a d-dimensional Bohr set to a (d+1)-dimensional Bohr set of the same width. And that would be much more like the Meshulam set-up where the codimension increases and that is all.

Reasons to be pessimistic.

Let me try to put as strongly as I can the argument that there is no hope of getting a density increase without a width sacrifice.

To begin with, think what a typical 3AP looks like. For the purposes of this argument, I’ll take B to be a sphere in \mathbb{R}^d. Since B is convex, the average of two points in B always lies in B. Therefore, there is a one-to-one correspondence between pairs of points in B and triples of points in B that form a 3AP. What does the average of two random points of B typically look like? Of course, it can be any point in B, but if B is high-dimensional, then a random point in B is close to the boundary, and a random second point in B is not only also close to the boundary, but it is approximately orthogonal to the first point (assuming that B is centred at the origin). Therefore, the average of the two points typically lives close to a sphere of radius 1/\sqrt{2} times the radius of B. Therefore, if we take A to be the set B\setminus(3B/4), we have a set of measure exponentially close to 1 (by which I mean exponentially in the dimension of B) with exponentially fewer 3APs than there are in B.

What this simple example shows is that if we want to obtain a density increase, it will not be enough to use the fact that A contains few 3APs — we will have to use the fact that it contains no 3APs. Even having exponentially few 3APs doesn’t help. So a straightforward Roth-style Fourier manipulation doesn’t work.

Pushing this example slightly further, even the set B\setminus((1-\alpha/d)B) has measure roughly \alpha. What can we say about the 3APs it contains? They live close to the boundary of a sphere, and that forces them to have small common difference. So one way that we might exploit the fact that A has no 3APs rather than just very few 3APs would be just to count 3APs with a small common difference (the smallness depending on both \alpha and d). Since there are exponentially fewer of these than there are 3APs in general, we really would be using more than just that there are exponentially few 3APs.

But if we restrict attention to 3APs with small common difference, can we hope to find a “global” density increase, as opposed to the “local” density increase one would obtain by passing to a smaller-width Bohr set? Consider what happens, for instance, if one has a subset of \mathbb{Z}_N with the wrong number of 3APs with small common difference. If “small” means “at most m” and m is substantially less than N, then one can take a fairly random union of intervals of length 10m, say. This will have many more than its fair share of 3APs of common difference less than m, but because of the randomness we will not detect any global correlation with a trignometric function.

Reasons to be less pessimistic.

We seem to be in a difficult situation: one example appears to force us to consider small common differences (though in fact Bourgain doesn’t, because instead of restricting the difference of the 3AP he restricts its central element to lie in a small Bohr set), while another example appears to suggest that from the fact that there are no 3APs with small common difference one cannot conclude that there is global correlation with a trigonometric function.

However, there is a mismatch between the two examples, and at the moment I cannot rule out that the mismatch is pointing to something fundamental. The mismatch is this: the first example (where we take a sphere and remove the heart) works because we are in a high dimension, whereas the second works because we are in a low dimension.

Let me explain what I mean. The first example relied strongly on measure concentration, so it is clear that it needed us to be in a high dimension. As for the second, it relied on our being able to say that if you take two points x,x+d in the set with d small, then x+2d is likely to be in the set. To achieve that, we took a union of balls of radius quite a bit larger than the smallness of the small common differences. But in high dimensions, if you want to be able to conclude from the fact that x and x+d both belong to some ball that x+2d also probably belongs to that ball, then you need the radius of the ball to be much larger: a constant factor is nothing like good enough. (Why? Because the two points will almost always be on the boundary and as far away as the smallness condition allows. And since the boundary is “curved on average”, or something like that, x+2d will not then be in the ball unless the radius is large enough for the boundary to feel flat at that distance scale.)

What interests me about this is that the smallness you need in order to deal with the first example seems to be very closely related to the smallness you need in order to make the second example work. In the first case, you need to drop down to a distance scale D with the property that if you take two typical points x,x+d in B (which will be near the boundary) then x+2d will typically belong to B as well. If we now try to create an example of the second type out of balls of radius D, then in order to get it to work, we need to have balls B' that are large enough to have the property that … if x,x+d belong to B' then x+2d probably does as well. In other words, we seem to be forced to take our sub-balls of B to be as big as B itself.

Who is correct, the optimist or the pessimist?

One problem with the optimist’s argument above is that it is qualitative. I argued qualitatively that the very high-dimensionality that makes the first example work stops the second example working. But it is conceivable that one might manage to turn that into a rigorous argument that showed that one could get away with dropping the width by a factor of 2 instead of something like \alpha/d, and that, it turns out, would produce only \log\log-type savings in the final bound.

But if the optimist is correct, then a natural question arises: how would one go about turning that qualitative argument into a rigorous and quantitative proof that not having small APs leads to a global correlation with a trigonometric function? One’s first instinct is to think that it would be necessary to classify Bohr sets according to their “true” dimension, or something like that — which would be difficult, as the structure of a Bohr set depends in subtle ways on the various linear relations between the characters that define it. If we take it as read that any such classification would be bound to lose constants in a way that would destroy any hope of the kind of exact result we would need, what does that leave?

The main thing we have to decide is our “distance scale”. That is, we are given a Bohr set B, and we need to define some other set B' and restrict attention to 3APs with common difference in B'. Or perhaps we will prefer to choose something more general like a probability measure \lambda that is concentrated on “small” values, and choose our common difference \lambda-randomly. But how do we make that choice without understanding all about B?

The only possible answer I can think of is to define B' or \lambda in some simple way in terms of B that is designed to give you sensible answers in the cases we understand. For instance, if B is actually a subspace of \mathbb{F}_3^n then we want to consider all differences, so we want \lambda to be the characteristic measure of B. And if B is a d-dimensional sphere, then we want \lambda to be a ball of radius chosen such that if you take a “shell” of B of measure \alpha, then an average 3AP will have common difference comparable to that radius.

It looks more and more as though it would be necessary to consider not just Bohr sets in isolation, but Bohr sets as members of ensembles. Fortunately, thanks to work of Ben Green and Tom Sanders, we have the idea of a Bourgain system to draw on there.

Let me give one further thought that makes me dare to hope a little bit. It seems that quite a lot of our problems are caused by the fact that high-dimensional Bohr sets have boundaries, and measure concentrated on those boundaries. But if we pass to a “shell” (by which I mean a set that is near the boundary) then it does not have a boundary. (By the way, any argument that seems to be making us consider a spherical shell is sort of interesting, given that it raises the hope of ultimately connecting with the Behrend lower bound.) In order to think about what happens when we are in a high-dimensional set with no boundary, let us now suppose we are in the group \mathbb{Z}_N^d. We are immediately encouraged to note that if a set in this group contains no 3APs, then we get correlation with a trigonometric function by the usual Fourier argument.

What happens, though, if we restrict the common difference to be small in some sense? I’m not sure, but let me at least do the Fourier calculation. It is not hard to check that \mathbb{E}_{x,d}f(x)f(x+d)f(x+2d)\lambda(d) transforms to \sum_{r,s}\hat{f}(r-s)\hat{f}(-2r+s)\hat{f}(r)\hat{\lambda}(-s), which can also be written as \sum_{r,s}\hat{f}(r+s)\hat{f}(-2r)\hat{f}(r-s)\hat{\lambda}(2s) or as \sum_{r+s+t=0}\hat{f}(r)\hat{f}(s)\hat{f}(t)\hat{\lambda}(r-t).

In low dimensions I would normally deal with such a sum by taking \lambda to be an AP with smoothed edges so that it had absolutely summable Fourier coefficients (which could easily be arranged to be real and non-negative). And then I would simply use averaging to say that there must be some value of r-t for which the sum is large. In high dimensions this is not good enough: the sum of the coefficients is exponential in the dimension, so the density increase we would get would be exponentially small. So how would we exploit the high-dimensionality? (Or perhaps it just isn’t the case that a local-ish 3APs count implies a global correlation.) I have just the vaguest of ideas here, which is that in high dimensions the set of places where the Fourier coefficients of \lambda are large are fairly dissociated. Perhaps one can show somehow that it is not possible for \sum_r\hat{f}(r+s)\hat{f}(-2r)\hat{f}(r-s) to be large for many s that form a dissociated set, so that the only way for the whole sum to be large is if there is some s for which it is very large. In other words, perhaps we can show that the naive averaging argument really is very inefficient.

I’m going to leave this here, but let me quickly make a remark about the pdf file that I linked to at the beginning of this post. It is not meant to be anything like a polished document, which means it shouldn’t even necessarily be assumed to be correct. In fact, at the top of page 11 I made quite an important mistake: the expression I wrote down is not the probability I said it was; to get that probability one needs to replace the third \nu_B by an average of some characteristic functions rather than characteristic measures, and that means that the approach works rather less neatly than I had hoped it would.

About these ads

15 Comments

  1. [...] me update this. There is a new post. Also see these [...]

    Pingback by Polymath6 « Euclidean Ramsey Theory — February 13, 2011 @ 9:42 pm

  2. Here is a toy problem that may possibly capture the kind of thing I am asking. I’ll work in the group G=\mathbb{Z}_N^d. Let B be the Bohr set [-N/8,N/8]^d (there is nothing special about the number 8 here), let \mu_B be the characteristic measure of B, and let \lambda=\mu_B*\mu_B. (There is not even anything particularly special about \lambda: I want something Bohr-set-like, but thought it might be convenient if it had more quickly decaying Fourier coefficients.) Suppose that f:G\to G is a bounded function (that is, \|f\|_\infty\leq 1) such that on average the product of f with a translate of \lambda correlates with a trigonometric function. Does it follow that f itself correlates with a trigonometric function?

    I’m not quite sure how to make that precise when f is an arbitrary function, but let us suppose that f=1_A for a subset A\subset G of density \alpha. Then I can give a quantitative version of the question as follows. For each x, define the trigonometric bias \tau(x) of A with respect to the translate T_x\lambda (where T_x\lambda(y)=\lambda(y-x) to be the maximum value of |\langle T_x\lambda(1_A-\alpha),\chi\rangle|, where \chi is a character on G. Suppose now that the average trigonometric bias is at least \rho\alpha. Does it follow that there exists a non-trivial character \chi such that |\hat{1}_A(\chi)|\geq c\rho\alpha (at least if \rho\geq\alpha)?

    A simple argument gives a positive answer but with c depending exponentially on the dimension d. The point of the question is to try to remove the dependence on d. And the reason it might conceivably be possible to do something like that is that obvious constructions such as partitioning \mathbb{Z}_N^d into 2^n boxes of side length N/2 and making A correlate with a random trigonometric function in each box simply don’t work: a typical translate of \lambda intersects all the boxes, so we don’t get the local correlation.

    I’m not claiming that a good result along these lines solves all our problems, but I do think that it would suggest strongly that this approach has possibilities.

    Comment by gowers — February 14, 2011 @ 10:06 am

  3. Let me suggest an approach to proving what I want. I would like to show that if g is a bounded function defined on \mathbb{Z}_N^d (that is, it takes values of modulus at most 1), then with high probability if you choose a random y\in\mathbb{Z}_N^d the inner product \mathbb{E}_xg(x)\lambda(x-y) is close to \mathbb{E}_xg(x). I haven’t quite found the calculation that shows this, but it feels as though the first expectation may be enough like taking an independent random sample of values of g to make the result true. If so, it might be the beginning of the local-to-global principle (I don’t mean quite what most people mean when they use that phrase) that I am looking for.

    Comment by gowers — February 14, 2011 @ 12:03 pm

    • It might have been clearer if I had said something like “d-wise independent” rather than “independent” above.

      Comment by gowers — February 14, 2011 @ 12:05 pm

    • Sorry — it was a stupid question in that it is trivially false. The counterexample is to take g to be a non-trivial trigonometric function that correlates with \lambda. What I think I want is to show that this sort of example is essentially the only kind. No time now, but I’ll have to think about a better formulation of the question.

      Comment by gowers — February 14, 2011 @ 12:26 pm

    • I think the kind of statement I’m going to want is that the only counterexamples are fairly “continuous” functions, which will necessarily have large Fourier coefficients (and not just any old Fourier coefficients either).

      Comment by gowers — February 14, 2011 @ 3:28 pm

  4. I have a question as an “observer”. Is it clear why the epsilon gained by Michael and Netz necessary small or perhaps we can hope also for a large epsilon? (If so maybe we can start with the 2/3 exponent, anyway, or even the loglogn Roth). A related question is: Is the argument of Michael and Netz allows adding an epsilon to Bourgain 2/3? (I am aware better results are known but still this seems interesting.)

    Comment by Gil Kalai — February 14, 2011 @ 6:55 pm

    • Tom Sanders has also asked this question. He is pretty sure there wouldn’t be much problem (apart from a certain necessary technical slog) in improving any of the 1/2, 2/3 or 3/4 bound by the Bateman-Katz epsilon. It seems that that epsilon is necessarily very small if you stick closely to their argument. Whether one can be more precise and say that there is a certain barrier beyond which one cannot go without a new idea I do not know.

      Comment by gowers — February 14, 2011 @ 7:54 pm

    • Gil–

      Someone asked similar questions via email earlier. Here was my comment then:

      ————

      About the size of epsilon in the BK paper: Section 6 in particular requires epsilon to be rather microscopic. This is the structural theorem for sets with some additive energy but no additive smoothing. As epsilon grows, the sharpness of the nonsmoothing hypothesis goes away; and over the course of the proof of this theorem, the nonsmoothing parameter gets magnified a number of times, leaving a vacuous theorem unless the nonsmoothing parameter (and consequently epsilon) is very small.
      The reason the nonsmoothing hypothesis can disappear as epsilon grows is that the size of the spectrum can increase substantially (– specifically it could be as large as (density)^{-3}). Then the random selection argument (–at least in its current form — which chooses sets of size about N) becomes a less effective way of estimating the number of m-tuples in the spectrum.

      ————-

      I have no idea whether you have looked at our paper, so I’ll just ramble a bit more in case it’s helpful. [BK] includes a theorem for sets that are not “additively smoothing”. A set S is said to be additively smoothing if its difference set has more structure than itself. One way to detect this is by comparing the L^p norms of the fourier transform of the set. (In fact this is how we define it precisely.) (For p even) We know that the L^p norm is the number of p-tuples in the set S. By Holder’s inequality, an estimate on the number of (say) 4-tuples gives us a free estimate on the number of (say) 8-tuples. If there are only this many 8-tuples, we say the set is NOT smoothing. If there are many more, we say the set IS smoothing. For example, consider a set of size M randomly distributed in a subspace of size M^{1+c} for some 0<c<1. This is the additively smoothing example because M-M is all of the subspace, which has perfect additive structure. An non-smoothing example is something like a bunch of (smaller) subspaces with no relation to each other. Here the set of (popular) differences is just the set we started with, which has (trivially) no additional additive structure.

      Epsilon being small allows us to conclude that the spectrum is nonsmoothing. The paper includes a structural theorem for nonsmoothing sets. Large epsilon means smoothing is a possibility. If there were an equally strong structural theorem for sets with additive smoothing, there might be some hope; but such a theorem would not be a trivial extension of our result.

      Michael

      Comment by Michael Bateman — February 14, 2011 @ 7:58 pm

    • (My apologies in advance for the poor formatting; I realized my faux pas with not enough time to fix it before tomorrow.)

      Here are some half-baked thoughts about possibly increasing the size of epsilon.

      My knowledge of covering lemmas and related technology is a bit thin. We already have a structural theorem for sets S such that S is not smoothing. Could we possibly use this to prove a structural theorem for sets S such that, say, 2S is not smoothing? how about 4S? etc. This seems like an interesting question because of the following sketch.

      As mentioned above, when epsilon grows the spectrum may become additively smoothing, which is a problem (at least for the existing technology). What I notice, however, is that even when epsilon is large, we may still conclude (something like?) one of the iterated difference sets is not additively smoothing. By using the random selection argument as in [BK], we can conclude that the number of 2m-tuples is less than

      N^{4m + mO(epsilon)} .

      Since the number of 4-tuples is known to be

      N^{7-O(epsilon)}

      in this case, it is possible for the number of 8-tuples to be as large as

      N^{15+ O(epsilon)}

      without reaching a contradiction. As epsilon grows, this ruins the non-smoothing of the spectrum.

      Write E_{2m} to denote the number of 2m-tuples in the spectrum S. Suppose we have a smoothing-like condition at every “step”. More precisely, suppose E_{2m} is larger than the trivial Holder bound over E_m plus an additional factor of E_m ^{beta} for some small number beta. If this is true for m=3,4,5,…, M, where M depends on beta and epsilon, then we contradict the estimate E_{2M} < N^{4M + MO(epsilon)} mentioned above that we obtained from the random selection argument. Hence we must not have this additional beta smoothing for every m. If we write S for the spectrum, this seems to say something an awful lot like "2mS is additively non-smoothing".

      Comment by Michael Bateman — February 15, 2011 @ 1:13 am

  5. Dear Tim,

    here are just some vague thoughts I had after reading your post and .pdf-file, which I’d like to write down here – basically in order to see whether I understood those things properly. Yet before getting started I should perhaps say that although this comment is unfortunately somewhat long, it doesn’t give any new ideas, it’s just sort of a reformulation of some things you’ve already said.

    It seems that one may look at any argument proving a version of Roth’s theorem that involves density increments as a method (in a not too algorithmic sense of this word) to actually find a 3AP in a set satisfying the requested density bound by making successively better guesses as to where such an 3AP could be. Thus in the original argument, we start with a set A living in \mathbb{Z}_N of size CN/loglogN, compute certain Fourier coefficients, and then guess that (one of) the 3AP(s) of A can actually be found in a certain subprogression, then we do the very same computations there, make a further guess, and so forth until our guesses become precise enough to actually locate 3AP inside A, at which point we are done. The verious improvements over Roth’s orinal result can then be regarded as providing descriptions of much better strategies for making these guesses.

    So far our guesses can also be thought of as assigning zeros and ones to the elements of A in each step, where those elements among which we still look for a 3AP get assigned ones, while the other ones receive zeros. If we formulate the strategy behind the proof like this, the idea of assigning reals from the interval [0, 1] instead of just zeros and ones doesn’t appear unnatural: So in each stage we could construct a function f from A to [0, 1], and an equation like f(a)=0 intuitively means “For the time being I won’t consider 3AP(s) through a any further”, while f(a)=1/10 could mean “At the moment it’s not particularly likely, but still possible that I will end up producing a 3AP through a“, an equation like “f(a)=2f(a’)” roughly means “Currently it seems twice as likely that our eventual 3AP will pass through a than that it passes through a'“, and so on.

    Now for Roth’s original argument it is definitely essential for technical reasons to just work with \{0, 1\}-valued functions (as one “changes N” throughout the proof), even though this appears to lead to some more or less arbitrary but at the same time rather immaterial choices concerning the boundaries of the subprogressions to which one passes when iterating. But already for Bourgains argument (my understanding of which on a conceptual level is surely by far more limited than yours), it doesn’t seem to be clear why one has to do so, and if I happen to understand what you suggest to some extent correctly, then you propose to work with a guessing function f whose values at the center of the Bohr set under consideration is much greater then the value of f near the boundary. (Instead of taking f to be the characteristic function of the Bohr set involved.)

    At this point, it seems that maybe one can even dispose of working with Bohr sets on a strictly technical level and instead merely “think of them in the back of our head”, transforming at each step of the iteration the definition of the Bohr set of which we “really think” into an appropriate definition of a certain guessing function (which probably then has to somehow “codify” certain pieces of “regularity information” on that Bohr set, etc.)

    Comment by Christian — February 14, 2011 @ 8:35 pm

  6. What I meant with the last paragraph was just this: It is not even clear why one should assign strict zeros instead of just very small numbers to the points outside the Bohr set under consideration, which conceivably might then turn out to be “technically easier”, though it should’t be essential either.

    Comment by Christian — February 14, 2011 @ 9:00 pm

  7. Maybe, given the amount of discussion, this is a good place to concentrate both polymath6ing and openly discussing both Roth and the cupset problem, both lower bounds and upper bounds.

    About 10-12 years ago Roy Mshulam and I thought quite extensively (without success) about trying to improve the Fourier argument even slightly. (We had more avant-garde ideas about the problem more recently that I discussed over my blog.) Anyway, we had a certain proposed conjecture (whose strength depends on various parameters) about general functions and I wonder how this conjecture survive the killer examples described by Tim and if the argument by Michael and Nets gives also it.

    So lets consider F_3^n and for a function f and q \ge 1 and 1 \le k \le n we denote by \|f\|_{q,k} the maximum over affine k-dimensional flats L of (3^{-k}\sum_{x\in L}|f(x)|^q)^{1/q}.

    Now the conjecture is that for some constant C and some negotiable \gamma,\alpha,q every set E \subset F_3^n of size n^{\gamma} the following holds:

    (**) \sum_{x\in E}~|\hat f(x)|\le c_1\|f\|_{q,n^\alpha}^2

    It turns out that if (**) holds with \gamma \to \infty, and \alpha/q \to 1 then the 3^n/n upper bound for cupsets can be improved to 3^n/n^\beta for every \beta.

    In fact, if you fix r between 2 and 3 you can have \beta > min\{(3-r)/r(1-\alpha/q), (6-2r+\gamma(r-2)/r)\}. So you can adjust the above parameters in the conjecture to imply stronger and weaker forms of the cap conjecture. We could say something for very very specific E’s but not for anything near the general case. We can adjust (**) with \alpha = q(1-c_2\log n/n) and \gamma=c_3n/\log n to have (**) implies (3-t)^n upperbounds so maybe some killer examples or some other examples already kill this. Also we can adjust the parameters to make \beta -1 tiny and one wonders if then (**) follows from the new results by Michael and Nets.

    Comment by Gil Kalai — February 20, 2011 @ 7:22 pm

    • Gil, are you prepared to make public the proof that the conjecture implies the bound you say? Or is it meant to be an easy exercise? (Just staring at it I feel a bit mystified, but perhaps if I made a serious attempt to prove the implication — and not in my head — I would realize that it was not too hard.) Or is it possible to give a sketch that makes the implication seem reasonable?

      Comment by gowers — February 22, 2011 @ 12:08 pm


RSS feed for comments on this post.

The Rubric Theme. Create a free website or blog at WordPress.com.

Follow

Get every new post delivered to your Inbox.

Join 244 other followers

%d bloggers like this: