However, even if Proposition 1 is approaching the status of “mutual knowledge”, it does not yet seem to be close to the status of “common knowledge”: one may secretly believe that Trump cannot be considered as a serious candidate for the US presidency, but must continue to entertain thi...
Further discussion of this journal can be foundat Tim Gowers’ blog. It should be fully operational in a few months (barring last-minute hitches, we should be open for submissions on 1 October 2012). Of course, a single journal is not going to resolve all the extant concerns about the ...
I then push everything back up to the master Github repository. The blueprint will take quite some time (about half an hour) to rebuild, but eventually it does, and the dependency graph (which Blueprint has for some reason decided to rearrange a bit) now shows “ruzsa-nonneg” in green...
This estimate is similar in spirit to the algebra estimates already in my paper, but unfortunately does not seem to follow immediately from these estimates as written, and so one has to repeat the somewhat lengthy decompositions and case checkings used to prove these estimates. We do this ...
as much as possible; similarly for the more detailedblueprint of the proofthat was prepared in order to formalize the result in Lean. I have been asked a few times whether it is possible to present a streamlined and more conceptual version of the proof in which one does not try to establ...
Let be the size of the largest subset of the cube that does not contain any combinatorial line. The density Hales-Jewett theorem of Furstenberg and Katznelson shows that . In the course of the Polymath1 project, the explicit values were established, as well as the asymptotic lower bound (...
This estimate is similar in spirit to the algebra estimates already in my paper, but unfortunately does not seem to follow immediately from these estimates as written, and so one has to repeat the somewhat lengthy decompositions and case checkings used to prove these estimates. We do this ...
of billions of other people is considerably less protection for one’s anonymity than one may initially think, and just because the first or bits of information you reveal about yourself leads to no apparent loss of anonymity, this does not mean that the next or bits revealed will do so ...
(but using Morawetz estimates instead of correction terms) has recently been established by Colliander-Grillakis-Tzirakis; this attains the superior range of , but in the focusing case it does not give global existence all the way up to the ground state due to a slight inefficiency in the ...
but it is not necessary to do so. Also note that Lean does not require parentheses when applying functions: we writeD khere rather thanD(k)(which in fact does not compile in Lean unless one puts a space between theDand the parentheses). This is slightly different from standard mathematica...