bio | website | gowers.wordpress.com |
---|---|---|
location | ||
age | ||
visits | member for | 5 years, 3 months |
seen | Mar 16 '14 at 23:40 | |
stats | profile views | 31,302 |
Mathematics professor at Cambridge
Jan 17 |
answered | Experimental Mathematics |
Jan 16 |
answered | Justifying a theory by a seemingly unrelated example |
Jan 15 |
answered | Nontrivial question about fibonacci numbers? |
Jan 15 |
awarded | Nice Question |
Jan 15 |
comment |
Improving a sequence of 1s and -1s
Quick question: does the set of 1s in a quasiperiodic sequence have to have a well-defined density? I keep trying to find a counterexample and I keep failing. |
Jan 15 |
awarded | Nice Question |
Jan 15 |
comment |
Has mathoverflow yet led to mathematical breakthroughs?
Apologies if I have asked the question in the wrong place -- meta isn't where it should be in my consciousness but I'll put it there now. |
Jan 15 |
revised |
Improving a sequence of 1s and -1s
added 432 characters in body |
Jan 15 |
comment |
Has mathoverflow yet led to mathematical breakthroughs?
My own feeling about use of the internet is that one can more or less prove that it isn't "crucial" in the fully anal sense, because there are other means of communication. But it can be crucial in the weaker sense of being so much more efficient that it makes the difference between progress not happening and happening. Your example isn't quite like that, since you'd presumably have completed your research in reasonable time without mathoverflow, but it's quite far along a spectrum towards that. |
Jan 15 |
asked | Has mathoverflow yet led to mathematical breakthroughs? |
Jan 15 |
revised |
Improving a sequence of 1s and -1s
deleted 6 characters in body |
Jan 15 |
revised |
Partial sums of multiplicative functions
edited tags |
Jan 15 |
asked | Improving a sequence of 1s and -1s |
Jan 9 |
comment |
Undecidable graph problems?
Yes, I was using it as a synonym for "independent", as the sometimes is used that way. |
Jan 8 |
revised |
Undecidable graph problems?
Corrected typo |
Jan 8 |
answered | Undecidable graph problems? |
Jan 8 |
awarded | Nice Question |
Jan 7 |
comment |
Partial sums of multiplicative functions
I was fairly sure that partial sums of mu were not better than the square root of n, but I didn't in fact know this argument, so thanks for giving it. I'll think about whether it can be adapted to work for the Liouville function. |
Jan 7 |
asked | Partial sums of multiplicative functions |
Dec 20 |
awarded | Nice Answer |