Mathematicians have found a new upper limit to the Ramsey number
quantamagazine.org
quantamagazine.org
(On a side note, I am so often stunned by the quality of articles on Quanta Magazine. I sorta thought this type of quality writing was dead and gone from the freely accessible web.)
Their YT videos are also top notch.
the one I looked at had overly-pretentious zooms and panning, while almost no actual info
I think that's almost literally what sfink said though:
> > they're creating a whole new form of proof that will almost certainly allow further decreases
It is working because its funded by Hedge fund founder billionaire/mathematician and they are not looking for subscription revenues (yet).
for the last 1-1,5 years quality of explanations in quanta's publications had been aaawful - with situation improving to the previous level only a month or so ago
I don't think funding source is the main explanation for quality (tho maybe for _ability_ to have quality)
Pi is feeling a little left out. If that turns out to be the true asymptotic behavior of Ramsey numbers, it would make one of the worst ever methods for computing digits of pi...
The main proof is an improvement to the 4^k bound (standing since 1935) to (4-eps)^k for some epsilon.
They additionally prove (I guess they have properties that make it slightly easier than other rounder/bigger numbers?) it for eps=2^-10 and eps=2^-7 specifically.
(3.993 then comes from the latter, 4 minus it gives 3.9921 and change, but of course you need to round that up to 3.993 in order to say it's a bound: it's not definitely less than 3.992, since it could lie between the two.)
So yes maybe/it probably can be improved from 3.993, because that's a bit of a tangential claim anyway - the main thing is that it's 'some non-zero amount less than 4'^k.
(But mostly yes it was beyond me, I won't pretend to be able to even attempt to understand the proof really.)
(They celebrated with a pint)
Some turn out to be more "productive" in the sense of leading to development of techniques, connections to other fields, etc.
Ramsey theory (the riddle discussed in the article) is one of these, here is just a short list of nontrivial applications to CS (admittedly, mostly to theory of CS):
If there weren't, well, probably you're better off?
That’s for the person to do something with or not. :) Not something that moderators should intervene in indirectly.
I won't explain my justification, since I'm supposed to be working right now. ;-)
(speaking as someone with a few previous second-chance submissions)
Of course in this case we're now discussing the opposite question and still not discussing the topic at hand.
Regarding timestamp inconsistencies: https://news.ycombinator.com/item?id=19774614