John R. Isbell

John Rolfe Isbell (October 27, 1930 – August 6, 2005)[1] was an American mathematician. For many years he was a professor of mathematics at the University at Buffalo (SUNY).

Biography edit

Isbell was born in Portland, Oregon, the son of an army officer from Isbell, a town in Franklin County, Alabama.[2][3][4] He attended several undergraduate institutions, including the University of Chicago, where professor Saunders Mac Lane was a source of inspiration.[3][4] He began his graduate studies in mathematics at Chicago, briefly studied at Oklahoma A&M University and the University of Kansas,[5] and eventually completed a Ph.D. in game theory at Princeton University in 1954 under the supervision of Albert W. Tucker.[3][4][6] After graduation, Isbell was drafted into the U.S. Army, and stationed at the Aberdeen Proving Ground.[3] In the late 1950s he worked at the Institute for Advanced Study in Princeton, New Jersey, from which he then moved to the University of Washington and Case Western Reserve University. He joined the University at Buffalo in 1969, and remained there until his retirement in 2002.[7]

Research edit

Isbell published over 140 papers under his own name, and several others under pseudonyms. Isbell published the first paper by John Rainwater, a fictitious mathematician who had been invented by graduate students at the University of Washington in 1952. After Isbell's paper, other mathematicians have published papers using the name "Rainwater" and have acknowledged "Rainwater's assistance" in articles.[8] Isbell published other articles using two additional pseudonyms, M. G. Stanley and H. C. Enos, publishing two under each.[4][8]

Many of his works involved topology and category theory:

In abstract algebra, Isbell found a rigorous formulation for the Pierce–Birkhoff conjecture on piecewise-polynomial functions.[11] He also made important contributions to the theory of median algebras.[12]

In geometric graph theory, Isbell was the first to prove the bound χ ≤ 7 on the Hadwiger–Nelson problem, the question of how many colors are needed to color the points of the plane in such a way that no two points at unit distance from each other have the same color.[13]

See also edit

References edit