The shortest papers ever published (2016)
paperpile.com
The shortest papers ever published (2016)
1–10 of 84 posts
Re: The shortest papers ever published (2016)
#2(2016)
Re: The shortest papers ever published (2016)
#3the writer’s block paper is art!
Re: The shortest papers ever published (2016)
#4Hmm. I'm wondering how the short lengths of these papers might cause them to have lower information-theoretic entropy than the (in)famous "chicken" talk[1]?
Re: The shortest papers ever published (2016)
#5Can someone explain the n^2 + 2 triangles paper?
Re: The shortest papers ever published (2016)
#6Can someone explain the n^2 + 2 triangles paper?
Abstract: probably
Re: The shortest papers ever published (2016)
#7Hmm. I'm wondering how the short lengths of these papers might cause them to have lower information-theoretic entropy than the (in)famous "chicken" talk[1]? [1] https://www.youtube.com/watch?v=yL_-1d9OSdk
We should note, however, that that work was disproven in 2019. As it turns out: Not chicken.
Re: The shortest papers ever published (2016)
#8Can someone explain the n^2 + 2 triangles paper?
Yes
Re: The shortest papers ever published (2016)
#9Hmm. I'm wondering how the short lengths of these papers might cause them to have lower information-theoretic entropy than the (in)famous "chicken" talk[1]? [1] https://www.youtube.com/watch?v=yL_-1d9OSdk
We should note, however, that that work was disproven in 2019. As it turns out: Not chicken.
So C = NC?
Re: The shortest papers ever published (2016)
#10Can someone explain the n^2 + 2 triangles paper?
The paper doesn't answer the problem in its title (n²+1) but demonstrates two different "advancements" towards it (n²+2)
> We have posed a fine (in our opinion) open problem and reported two distinct “behold-style” proofs of our advance on this problem.
There's also a linked PDF which, if I'm reading it correctly, trivially proves n²+1 is impossible.