Skip to main content
18 events
when toggle format what by license comment
Sep 9, 2018 at 16:05 history edited Wolfgang CC BY-SA 4.0
Minor typos
Apr 7, 2016 at 21:37 comment added Turbo @NoamD.Elkies Actually even for small alphabet it is not constructivised.
Dec 30, 2015 at 4:51 answer added Fedor Petrov timeline score: 5
Dec 30, 2015 at 1:08 history edited Turbo CC BY-SA 3.0
added 1 character in body; edited title
Dec 30, 2015 at 0:46 history edited Turbo CC BY-SA 3.0
added 159 characters in body
Dec 27, 2015 at 20:15 comment added Turbo @NoamD.Elkies i did not know and that sounds interesting.. also I think many other results from probabilistic number theory should fall here
Dec 27, 2015 at 20:14 comment added Turbo @TimothyChow Only probabilistic methods.. it will be good to get some opinion on this as well mathoverflow.net/questions/227062/…
Dec 27, 2015 at 19:48 comment added Noam D. Elkies Even in the case of coding theory the algebraic-geometry methods work only for some parameter choices. For example the best asymptotic bounds known for self-dual binary codes are still probabilistic.
Dec 27, 2015 at 19:32 comment added Timothy Chow To clarify, you're not interested in cases where existence is proved by Borsuk-Ulam, or combinatorial Nullstellensatz, or pigeonhole, but only by probabilistic methods?
Dec 27, 2015 at 19:28 answer added Timothy Chow timeline score: 10
Dec 27, 2015 at 19:20 answer added Timothy Chow timeline score: 9
Dec 27, 2015 at 18:10 answer added Ofir Gorodetsky timeline score: 8
Dec 27, 2015 at 16:45 answer added Paul Siegel timeline score: 26
Dec 27, 2015 at 15:24 answer added Jan-Christoph Schlage-Puchta timeline score: 4
Dec 27, 2015 at 1:03 answer added Thomas Kalinowski timeline score: 15
Dec 27, 2015 at 0:58 history made wiki Post Made Community Wiki by Todd Trimble
Dec 27, 2015 at 0:17 history edited GH from MO CC BY-SA 3.0
edited body
Dec 27, 2015 at 0:15 history asked Turbo CC BY-SA 3.0