Skip to main content
Anurag's user avatar
Anurag's user avatar
Anurag's user avatar
Anurag
  • Member for 11 years, 7 months
  • Last seen more than a month ago
comment
How to recognise that the polynomial method might work
@FedorPetrov: only the prime case of Olson's theorem follows from Alon-Furedi hyperplane covering. Though that has been "fixed" recently by Clark et al. (and by Brink before that) by generalising another result of Alon-Furedi. See section 4 of arxiv.org/pdf/1404.7793v2.pdf. In fact many combinatorial results that follow from combinatorial nullstellensatz can alternately be seen as direct applications of this Alon-Furedi bound.
revised
Generalized geometries
added a relevant tag
Loading…
suggested
Approve
awarded
answered
Loading…
answered
Loading…
comment
revised
Loading…
Loading…
Loading…
comment
What is the field with one element?
Thanks for the clarification and for the reference. My office mate works on this stuff and I think he would enjoy reading that article as well.
comment
What is the field with one element?
Are you sure that the example is due to Henry Cohn? From what I have heard in lectures on F1 theory, including one lecture by Manin, this example was due to Jacques Tits.
awarded
revised
The most number of points that realize only $k$ distinct distances
replaced "first known bound" to "first good bound"
Loading…
comment
The most number of points that realize only $k$ distinct distances
You are welcome. You can also find the proof of Larman, Rogers and Seidel here: mathoverflow.net/questions/17006/…
Loading…
Loading…
revised
When the Lovász theta-function saturates its upper bound
fixed some typos, and added a new tag
Loading…
1
5 6
7
8 9
14