Friday, June 16, 2006

The True North strong and free

The 30th Frameline film festival is under way. It can exist, and be such a big production, thanks to the contributions of the Frameline members and to the major sponsors. In addition, each screening has its own sponsor. The movie I saw today was sponsored by ... Canada!

No kidding.

This is not an isolated act of kindness. The Frameline programmer who introduced the movie said that, over time, the Canadian government has contributed more than the US federal government to the festival.

I have two things to say: (1) foreign aid to needy countries is very noble; (2) I blame the electoral college.

Thursday, June 15, 2006

In Theory: non-judgemental for five more years

Found today in a fortune cookie:
At 20 years of age the will reigns; at 30 the wit; at 40 the judgement.

My gut is better than yours

Scott complains that "art snobs" want to have it both ways: to assert that the beauty of art is an aesthetic experience, a gut feeling, and, at the same time, that certain tastes are more valid than others. What is this, do they think that their guts are better than ours? That's certainly not how we do things in complexity theory. Or is it?

When we talk about the "beauty" of a theorem or of a proof, we rarely refer to the literal statement of the theorem, much less to the fact that the proof is correct.

The beauty of a theorem is typically found in the way it fits into the bigger fabric of a theory, how it is explained by, and how it explains, other results. The statement of a theorem can feel comforting, surprising, or even unsettling, or worrisome. In a proof, we appreciate economy, a way of getting to the point in what feels like the "right" way, an unexpected use of techniques, a quick turn and a surprising ending.

If we think of, say, Reingold's proof that L=SL, we (meaning, I and some other people) appreciate the statement for being a major milestone in the program of derandomization, and we appreciate the proof for the simplicity of its structure and for the cleverness of the way its technical tools are used.

Although, in the end, it is a matter of taste to see that the statement is important and that the proof is beautiful, I don't think that the taste of the expert in the area is equally valid as the taste of the non-expert who says, oh this is an algorithm for connectivity that runs in n100 time and it does not even work on directed graphs?

(I am so delighted to have a discussion where one can take the notion of mathematical beauty for granted, and then use it to argue about artistic beauty.)

This wouldn't be a non-technical In Theory post without an unnecessary personal story, so let me conclude with my experience with modern dance.

At one point, a few years ago, I was taken to see several modern dance performances. My first experience was not unlike Woody Allen's in Small Time Crooks. While the sound system was playing annoying and discordant sounds, people on stage were moving around in what looked like a random way. I was convinced that the nearly sold-out audience at Zellerbach (it's a big theater) was there simply to feel good about themeselves and nobody could really like that stuff. There was something that puzzled me, however: at one point, everybody laughed, presumably because something (intentionally) funny happened in the choreography. Everybody got it (except me, of course), so perhaps there was something going on in those random movements, after all. After a few more shows, the experience started to feel less agonizing, and I started to notice that I would like some segments better than others, and that this would agree with what others thought. Finally, one night, I laughed out when a dancer did something really funny on stage, and so did the rest of the audience. Aha, the brainwashing had succeeded! I left the theater feeling good about myself... No, wait, this is so not the point I wanted to make...

Wednesday, June 14, 2006

Snoop Dogg raps about complexity

I can't decide if this is funny or racist. (From Gizoogle.)

Monday, June 12, 2006

Polynomials and subspaces

My latest post on Szemeredi's theorem was long and rambling, mostly because I had no idea what I was talking about. There are, however, a couple of neat questions, and I am afraid they got lost in the rambling, so let me state them again.

  1. It is either known or probably derivable from known proof techniques that
    If f:{0,1}^n -> {0,1} has agreement 1/2+eps with a degree-k polynomial, then there is an affine subspace V of {0,1}n, of dimension n/c, and a linear function L, such that f and L have agreement 1/2 + eps' when restricted to V. Here c=c(k) is a constant that depends only on k and eps'=eps'(eps,k) is a constant that depends only on eps and on k.

    This is somewhat surprising, even if you look at the special case of a function f that is a polynomial (as opposed to being correlated with a polynomial).

    Is there a simple proof of this result? Is the result true if you replace "subspace" by "restriction"? (Meaning, you are only allowed to fix all but a constant fraction of the variables.) Shouldn't this be useful in complexity theory somewhere?

    [Update 7/14/06: the degree-2 case has indeed a very simple proof. A more general result is proved here, in section 7. For higher degree, the result is actually false, in the sense that it is impossible to find a subspace of dimension constant*n. Avi Wigderson and I have found a counterexample already for degree 3, and Ben Green has sharpened our lower bound. The best one can do for degree-k polynomials is to find a subspace of dimension about n(1/(k-1)).]



  2. If f has agreement 1/2+eps with a linear function L in a subspace V of dimension n-t, then there is a linear function L' such that f and L' agree on a fraction at least 1/2+eps/2t of all of {0,1}n

    This is fairly easy to see.

  3. This is a fascinating challenge: find an simple proof (or any proof that fits in fewer than, say, 20 pages) that if f:{0,1}n->{-1,1} has dimension-k Gowers uniformity at least eps, then there is a linear subspace V of dimension n/c and a linear function L, such that f and L have agreement at least 1/2+eps' on V. (Where c=c(k) and eps'=eps'(eps,k).)

    Chances are that such a proof could be turned into a simpler proof of Gowers's quantitative version of Szemeredi's theorem. (A proof of the above result for boolean functions can probably be "translated back" from Gowers's paper, and it would probably be at least 50-60 pages. As I understand it, such a proof would first argue that f is correlated with a polynomial in a large subspace, and then proceed with (1) above. I wonder: can one prove such a statement without mentioning polynomials at all?)

  4. Unfortunately the conclusion cannot be strenghtened to "... there is a linear subspace V of dimension n-o(n)...". Consider
    f(x1,...,x1):= x1*x2+...+ xn-1*xn mod 2

    Its dimension-3 Gowers uniformity is 1, but, if you could find a subspace V of dimension n-o(n) on which f agrees with a linear function on a 1/2+eps' fraction of inputs, then you could also find a linear function that agrees with f on a 1/2+eps/2o(n) fraction of inputs. But we know that no linear function agrees with f on more than a 1/2+1/2n/2 fraction of inputs.