Although these short papers are fun, I think the most interesting papers are those that are both important and concise. One of my favorite examples is Josh Nash's proof of the existence of Nash Equilibria (which is a foundational concept in game theory and arguably won Nash a Nobel):
Agreed. In a few days I'm supposed to give a lecture about how to write great scientific papers. I wasn't aware of this paper (I'm aphysicist, not a mathematician), but nevertheless I'm going to discuss it with the class, its conciseness is exemplary! Thanks a lot!
"A year later, when I began to worry about a thesis topic, Neyman just shrugged and told me to wrap the two problems in a binder and he would accept them as my thesis."
Each paper was seven pages, which would make a fourteen page thesis.
Very, cool! In fact, a paper which solved one of these problems [1] is precisely 7 pages. Additionally, it contains the footnote: "The main results of this paper were obtained by the authors independently of each other using entirely different methods."
"Cole’s lecture was different. He did not speak a single word. He simply went to the board, and began to calculate. On one side of the board, he calculated 267 – 1 = 147,573,952,589,676,412,927 by hand. Then he went to the other side of the board and worked out the product of 193,707,721 and 761,838,257,287, the factors of 147,573,952,589,676,412,927. After spending the silent hour working out the calculations, Cole simply turned around and went back to his seat, completely silent! The audience erupted into a standing ovation."
A bit tangential but amusing: my PhD dissertation was 51 pages, all math. One of my committee members approved of the work but wanted the dissertation to be bulked up with a program listing- thankfully my advisor firmly rejected this suggestion :-)
I fail to understand how the content in the Soifer paper (triangles) answers its title question. So yes, some explanation would have been necessary in my opinion.
That's the thing, most of these are actually pretty bad papers. Their editors were right, it would have been improved with at least a couple of sentences of background info or explanation. For example, why is that problem even an interesting one to ask? Should we expect the answer to the titular question to be no? Is there anything particularly novel or interesting about the existence proof they've provided that could maybe be applied to other problems? And so on.
My Favorite is Dan Janzen's paper "Yes?" that was published in Biotropica in 1978. Here it is in full:
Yes?
No.
Acknowledgments: This study was supported by NSF DEB77-04889,
and grew out of discussion with the Society for Historical Orations on Theory.
Daniel H. Janzen
Department of Biology,
University of Pennsylvania,
Philadelphia, Pennsylvania 19104, USA
In my opinion, it is clear the author simply copied that video, because not only is it the exact same set of papers, if memory serves (as I watched it only last week), it is in the exact same order, which is particularly determinative. Citation would be appropriate at the very least.
On a related note, I'm fond of this Mathoverflow answer, "Which math paper maximizes the ratio (importance)/(length)?"[1]
Highlights include:
1. A one-sentence proof published in American Mathematical Monthly that costs $19 to download on JSTOR,
2. The 8-page paper that introduced ζ (zeta) notation, two proofs of the ζ(s) L-function, several new methods in analytic and number theory, and (most famously) the Riemann Hypothesis,
3. Lebesque's paper introducing modern measure theory,
4. Elkies' paper proving the (titular) existence of infinitely many supersingular primes for every elliptic curve defined on the rationals.
It seems it was a bit easier to publish short, dense material in the 20th century :)
Though an interesting article, it should be noted that the article reproduces and makes available copyrighted - and expensive - materials. Case in point, a $40 PDF that was converted to a .png and displayed on the site:
E. W. Dijkstra, “Solution of a problem in concurrent programming control,” Commun. ACM, vol. 8, no. 9, p. 569, Sep. 1965.
Just one page, no references (understandable, since it is one of the very first papers on concurrent algorithms), proposes a mechanism for mutual exclusion between N processes.
Negative results are pretty useful. Eg the next time someone comes across a similar measurement, they can take that paper for some inspiration of a list of things to check.
[+] [-] johnjwang|8 years ago|reply
http://www.pnas.org/content/36/1/48.full
It's less than a full page in the original journal.
[+] [-] tinyrick2|8 years ago|reply
https://rbsc.princeton.edu/sites/default/files/Non-Cooperati...
[+] [-] ziotom78|8 years ago|reply
[+] [-] kayhi|8 years ago|reply
https://www.nature.com/nature/dna50/watsoncrick.pdf
[+] [-] alvis|8 years ago|reply
[+] [-] tacon|8 years ago|reply
https://johnmorton1000.files.wordpress.com/2014/11/1976-recu...
[+] [-] mygo|8 years ago|reply
[+] [-] kendallpark|8 years ago|reply
https://en.wikipedia.org/wiki/George_Dantzig#Mathematical_st...
"A year later, when I began to worry about a thesis topic, Neyman just shrugged and told me to wrap the two problems in a binder and he would accept them as my thesis."
Each paper was seven pages, which would make a fourteen page thesis.
[+] [-] stochastic_monk|8 years ago|reply
[1] https://projecteuclid.org/euclid.aoms/1177729695
[+] [-] folli|8 years ago|reply
This makes it the most expensive piece of literature (cost per word) that I know of.
[+] [-] visarga|8 years ago|reply
[+] [-] onychomys|8 years ago|reply
[+] [-] Vinnl|8 years ago|reply
[+] [-] danohu|8 years ago|reply
"Cole’s lecture was different. He did not speak a single word. He simply went to the board, and began to calculate. On one side of the board, he calculated 267 – 1 = 147,573,952,589,676,412,927 by hand. Then he went to the other side of the board and worked out the product of 193,707,721 and 761,838,257,287, the factors of 147,573,952,589,676,412,927. After spending the silent hour working out the calculations, Cole simply turned around and went back to his seat, completely silent! The audience erupted into a standing ovation."
https://musingsonmath.com/2012/10/31/one-long-multiplication...
[+] [-] jacquesm|8 years ago|reply
I think I spotted an error there.
[+] [-] slazaro|8 years ago|reply
This is another error (though this one is actually in the article). The factors are 23 and 89.
[+] [-] 2sk21|8 years ago|reply
[+] [-] blauditore|8 years ago|reply
[+] [-] shmageggy|8 years ago|reply
[+] [-] whyenot|8 years ago|reply
[+] [-] xelxebar|8 years ago|reply
I just had to look this one up though, so for posterity: https://doi.org/10.2307/2387687.
[+] [-] yosyp|8 years ago|reply
[+] [-] xtreme|8 years ago|reply
[+] [-] andy-wu|8 years ago|reply
[+] [-] jerf|8 years ago|reply
[+] [-] seanmcdirmid|8 years ago|reply
[+] [-] a_c|8 years ago|reply
[+] [-] dsacco|8 years ago|reply
1. A one-sentence proof published in American Mathematical Monthly that costs $19 to download on JSTOR,
2. The 8-page paper that introduced ζ (zeta) notation, two proofs of the ζ(s) L-function, several new methods in analytic and number theory, and (most famously) the Riemann Hypothesis,
3. Lebesque's paper introducing modern measure theory,
4. Elkies' paper proving the (titular) existence of infinitely many supersingular primes for every elliptic curve defined on the rationals.
It seems it was a bit easier to publish short, dense material in the 20th century :)
_________________________________
1. https://mathoverflow.net/questions/7330/which-math-paper-max...
[+] [-] sebleon|8 years ago|reply
"Cuando despertó, el dinosaurio todavía estaba allí."
English:
"When he woke up, the dinosaur was still there."
[+] [-] zoul|8 years ago|reply
[+] [-] ManuelKiessling|8 years ago|reply
'For sale: baby shoes, never worn.'
[+] [-] jahsjahs|8 years ago|reply
https://academic.oup.com/analysis/article-abstract/38/4/208/...
[+] [-] nesyt|8 years ago|reply
http://www-bcf.usc.edu/~kleinsch/Gettier.pdf
[+] [-] leephillips|8 years ago|reply
[+] [-] ar-jan|8 years ago|reply
0: https://pbs.twimg.com/media/BmLQjz0CMAA-l28.jpg:large
[+] [-] mzl|8 years ago|reply
[+] [-] dotancohen|8 years ago|reply
https://cdn.paperpile.com/blog/files/Goldberg-2014.
[+] [-] pmalynin|8 years ago|reply
http://blogs.nature.com/thescepticalchymist/files/2014/06/nc...
http://blogs.nature.com/thescepticalchymist/2014/06/a-chemic...
[+] [-] xbryanx|8 years ago|reply
https://www.improbable.com/airchives/classical/articles/pean...
[+] [-] lou1306|8 years ago|reply
E. W. Dijkstra, “Solution of a problem in concurrent programming control,” Commun. ACM, vol. 8, no. 9, p. 569, Sep. 1965.
Just one page, no references (understandable, since it is one of the very first papers on concurrent algorithms), proposes a mechanism for mutual exclusion between N processes.
[+] [-] vadimberman|8 years ago|reply
Or it's something completely different?
[+] [-] eru|8 years ago|reply