News for hackers. Stuff that matters.
Re:Math Overflow users resolve PhD thesis crisis by no_identd on Tuesday August 04, 2020 @11:17AM (#24050802)
>"the faculty will not accept asymptotics"

the hell does that mean?

Re:Math Overflow users resolve PhD thesis crisis by impendia on Tuesday August 04, 2020 @11:21AM (#24050850)
(Math professor here).

Ambiguous and poorly explained. (Note the question immediately afterwards asking for clarification.) But probably something along the general lines of "My advisor said that, if my main theorem is an asymptotic estimate instead of an exact formula, then this would not be judged to be novel/strong enough to earn a Ph.D."

Re:Math Overflow users resolve PhD thesis crisis by mywittyname on Tuesday August 04, 2020 @01:23PM (#24052278)
If you don't mind, could you explain the practical difference or the reasoning behind such a requirement? Are there situations where boundaries appear to be asymptotic but the exact solution shows this not to be the case?
Re:Math Overflow users resolve PhD thesis crisis by impendia on Tuesday August 04, 2020 @02:05PM (#24052727)
Once again, I don't understand the Math Overflow poster's exact situation.

But roughly speaking, imagine you have two functions f(t) and g(t), which are described in completely different ways, and you want to prove that f(t) = g(t). If you try and fail, then you might instead aim for a proof that the difference between f and g is bounded, or that f(t) = O(g(t)) and vice versa, or that the limit of the ratio between f and g is 1, or something along these lines.

In many cases, such partial results are also of interest. In general, partial successes in math are considered to be successes.

But in some cases, partial results aren't really considered all that interesting -- or perhaps are known already or can be obtained very easily.

Re:Math Overflow users resolve PhD thesis crisis by rrobukef on Tuesday August 04, 2020 @02:01PM (#24052675)
I re-implemented a quasi-polynomial algorithm. Experimentally, it shows exponential behaviour. Back-of-the-envelope calculation shows this behaviour can continue until the input size is >>10^21 before the asymptotic bound asserts itself. (For comparison, input size 30 is unfeasible)
Re:Math Overflow users resolve PhD thesis crisis by Ragib_Zaman on Tuesday August 04, 2020 @03:19PM (#24053507)
Which algorithm?
Re:Math Overflow users resolve PhD thesis crisis by rrobukef on Wednesday August 05, 2020 @05:42AM (#24058893)
Parys' quasi-polynomial algorithm for solving parity games, https://arxiv.org/pdf/1904.12446.pdf

Note, another implementation doesn't have this behaviour for the family of inputs I use. It's an implementation detail that has no effect on correctness. Thus for the other implementation another family should exist.

Re:Math Overflow users resolve PhD thesis crisis by boyobo on Tuesday August 04, 2020 @02:38PM (#24053131)
I mean, maybe they need to exponentiate the bound or something. e.g. 2^(4n) is much much much worse than 2^n.

The sentence did strike me a little wierd though.