- Richard K. Guy
Richard Kenneth Guy (born 1916,
Nuneaton, Warwickshire) is a British mathematician, Professor Emeritusin the Department of Mathematicsat the University of Calgary.
He is best known for co-authorship (with John Conway and
Elwyn Berlekamp) of " Winning Ways for your Mathematical Plays" and authorship of " Unsolved Problems in Number Theory" (ISBN 0-387-94289-0), but he has also published over 100 papers and books covering combinatorial game theory, number theoryand graph theory.
He is said to have developed 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.
Additionally, around 1959, Guy discovered a
unistable polyhedronhaving only 19 faces; no such construct with fewer faces has yet been found.
Guy is also a notable figure in the field of
chess endgame studies. He composed around 200 studies, and was co-inventor of the Guy-Blandford-Roycroft codefor classifying studies. He also served as the endgame study editor for the " British Chess Magazine" from 1948 to 1951.
Guy wrote four papers with
Paul Erdős, giving him an Erdős numberof 1.
*Richard K. Guy:
Aviezri Fraenkeland Combinatorial Games. Electr. J. Comb. 8(2): (2001)
Béla Bollobás, Richard K. Guy: Equitable and proportional coloring of trees. J. Comb. Theory, Ser. B 34(2): 177–186 (1983)
*Richard K. Guy,
Gerhard Ringel: Triangular imbedding of Kn – K6. J. Comb. Theory, Ser. B 21(2): 140–145 (1976)
* [http://www.math.ucalgary.ca/general/directory.php3?personid=36&capacityid=22 Personal web page]
Wikimedia Foundation. 2010.