Related Research Articles
The Erdős number describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. The same principle has been applied in other fields where a particular individual has collaborated with a large and broad number of peers.
Delbert Ray Fulkerson was an American mathematician who co-developed the Ford–Fulkerson algorithm, one of the most well-known algorithms to solve the maximum flow problem in networks.
Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.
Fan-Rong King Chung Graham, known professionally as Fan Chung, is an American mathematician who works mainly in the areas of spectral graph theory, extremal graph theory and random graphs, in particular in generalizing the Erdős–Rényi model for graphs with general degree distribution.
Paul Erdős was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. Erdős pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, and probability theory. Much of his work centered around discrete mathematics, cracking many previously unsolved problems in the field. He championed and contributed to Ramsey theory, which studies the conditions in which order necessarily appears. Overall, his work leaned towards solving previously open problems, rather than developing or exploring new areas of mathematics.
Pál Turán also known as Paul Turán, was a Hungarian mathematician who worked primarily in extremal combinatorics.
Elwyn Ralph Berlekamp was a professor of mathematics and computer science at the University of California, Berkeley. Berlekamp was widely known for his work in computer science, coding theory and combinatorial game theory.
Richard Kenneth Guy was a British mathematician. He was a professor in the Department of Mathematics at the University of Calgary. He is known for his work in number theory, geometry, recreational mathematics, combinatorics, and graph theory. He is best known for co-authorship of Winning Ways for your Mathematical Plays and authorship of Unsolved Problems in Number Theory. He published more than 300 scholarly articles. Guy proposed the partially tongue-in-cheek "strong law of small numbers", which says there are not enough small integers available for the many tasks assigned to them – thus explaining many coincidences and patterns found among numerous cultures. For this paper he received the MAA Lester R. Ford Award.
Mark Kac was a Polish American mathematician. His main interest was probability theory. His question, "Can one hear the shape of a drum?" set off research into spectral theory, the idea of understanding the extent to which the spectrum allows one to read back the geometry.
Carl Bernard Pomerance is an American number theorist. He attended college at Brown University and later received his Ph.D. from Harvard University in 1972 with a dissertation proving that any odd perfect number has at least seven distinct prime factors. He joined the faculty at the University of Georgia, becoming full professor in 1982. He subsequently worked at Lucent Technologies for a number of years, and then became a distinguished Professor at Dartmouth College.
Joel Spencer is an American mathematician. He is a combinatorialist who has worked on probabilistic methods in combinatorics and on Ramsey theory. He received his doctorate from Harvard University in 1970, under the supervision of Andrew Gleason. He is currently a professor at the Courant Institute of Mathematical Sciences of New York University. Spencer's work was heavily influenced by Paul Erdős, with whom he coauthored many papers.
Dennis Elliot Shasha is an American professor of computer science at the Courant Institute of Mathematical Sciences, a division of New York University. He is also an associate director of NYU WIRELESS. His current areas of research include work done with biologists on pattern discovery for microarrays, combinatorial design, network inference, and protein docking; work done with physicists, musicians, and professionals in finance on algorithms for time series; and work on database applications in untrusted environments. Other areas of interest include database tuning as well as tree and graph matching.
Stefan Andrus Burr is a mathematician and computer scientist. He is a retired professor of Computer Science at The City College of New York.
Vojtěch Rödl is a Czech American mathematician, Samuel Candler Dobbs Professor at Emory University. He is noted for his contributions mainly to combinatorics having authored hundreds of research papers.
Colm Mulcahy is an Irish mathematician, academic, columnist, book author, public outreach speaker, and amateur magician. He is Professor Emeritus at Spelman College, where he was on the faculty from 1988 to 2020. In addition to algebra, number theory, and geometry, his interests include mathemagical card magic and the culture of mathematics–particularly the contributions of Irish mathematicians and also the works of iconic mathematics writer Martin Gardner. He has blogged for the Mathematical Association of America, The Huffington Post, Scientific American, and (aperiodically) for The Aperiodical; his puzzles have been featured in The New York Times. Mulcahy serves on the Advisory Council of the Museum of Mathematics in New York City. As of January 2021, he is Chair of Gathering 4 Gardner, Inc. He is the creator and curator of the Annals of Irish Mathematics and Mathematicians.
David Anthony Klarner was an American mathematician, author, and educator. He is known for his work in combinatorial enumeration, polyominoes, and box-packing.
Felix Adalbert Behrend was a German mathematician of Jewish descent who escaped Nazi Germany and settled in Australia. His research interests included combinatorics, number theory, and topology. Behrend's theorem and Behrend sequences are named after him.
In recreational mathematics, rope-burning puzzles are a class of mathematical puzzle in which one is given lengths of rope, fuse cord, or shoelace that each burn for a given amount of time, and matches to set them on fire, and must use them to measure a non-unit amount of time. The fusible numbers are defined as the amounts of time that can be measured in this way.
Neil J. Calkin is a professor at Clemson University in the Algebra and Discrete Mathematics group of the School of Mathematical and Statistical Sciences. His interests are in combinatorial and probabilistic methods, mainly as applied to number theory.
References
- ↑ Publication list from Winkler's home page at Dartmouth.
- 1 2 Information listed on Peter Winkler's homepage at Dartmouth.
- ↑ Dartmouth mathematics faculty listing.
- ↑ Peter Winkler at the Mathematics Genealogy Project.
- ↑ "Humboldt network profile of Peter Winkler". www.humboldt-foundation.de. Retrieved 2019-09-17.
- ↑ The Bridge World Bookstore Bridge at the Enigma Club by Peter Winkler
- ↑ The 2011 Master Point Press Book Of The Year Award 2014 IPBA Handbook, p. 176
- ↑ "Overhang", American Mathematical Monthly , vol. 116, January 2009 (Online)
"Maximum Overhang", American Mathematical Monthly , vol. 116, December 2009 (Online) - 1 2 Hoffman, Paul (15 July 1998). The Man Who Loved Only Numbers / The Story of Paul Erdös and the Search for Mathematical Truth . "The Man Who Loved Only Numbers" was published in hardcover by: Hyperion Books and a later edition was published by The New York Times Book Company. ISBN 0-7868-6362-5 . Retrieved November 23, 2017.
