Live data from Hacker News

The shortest papers ever published (2016)

paperpile.com

81–84 of 84 posts

Re: The shortest papers ever published (2016)

#81
post #28

Vaguely related but I remember the tale of an author on vacation after publication of his latest novel. He telegramed his publisher to enquire about reception: “?” Publisher replied: “!”

Victor Hugo inquiring if Les Misérables was selling well.

That's the one, thank you!

Re: The shortest papers ever published (2016)

#83
post #50

Earlier quoted context omitted.

It couldn't.

Pretty damn close though! I haven't seen an explanation of what the second figure is trying to show so I'm not sure about that one. (And also their assertion that no further explanation is necessary is clearly bullshit.)

Its attempts at explaining both figures are totally wrong. Wrong side lengths, wrong assertion that the small triangles fit inside the large triangles, wrong relationship between the figures, complete misunderstanding of the second figure.

The second figure is actually showing another arrangement of n²+2 small unit equilateral triangles covering an equilateral triangle of side length n+ε.

Re: The shortest papers ever published (2016)

#84
post #10

Earlier quoted context omitted.

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.

No, n^2+1 is an open problem (conjectured to be impossible though)

Ah yeah, the PDF shows it for n=2 and I assumed that scaled up but it doesn't.
Post reply on HN