Roger Lyndon

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Roger Conant Lyndon (1917–1988) was an American mathematician, for many years a professor at the University of Michigan.[1] He is known for Lyndon words, the Curtis–Hedlund–Lyndon theorem, Craig–Lyndon interpolation and the Lyndon–Hochschild–Serre spectral sequence.

Biography[edit]

Lyndon was born on December 18, 1917 in Calais, Maine, the son of a Unitarian minister. His mother died when he was two years old, after which he and his father moved several times to towns in Massachusetts and New York. He did his undergraduate studies at Harvard University, originally intending to study literature but eventually settling on mathematics, and graduated in 1939. He took a job as a banker, but soon afterwards returned to graduate school at Harvard, earning a master's degree in 1941. After a brief teaching stint at the Georgia Institute of Technology, he returned to Harvard for the third time in 1942 and while there taught navigation as part of the V-12 Navy College Training Program while earning his Ph.D.[1] He received his doctorate in 1946 under the supervision of Saunders Mac Lane.[1][2]

After graduating from Harvard, Lyndon worked at the Office of Naval Research and then for five years as an instructor and assistant professor at Princeton University before moving to Michigan in 1953.[1] At Michigan, he shared an office with Donald G. Higman;[3] his notable doctoral students there included Kenneth Appel and Joseph Kruskal.[2]

Lyndon died on June 8, 1988, in Ann Arbor, Michigan.[1]

Research[edit]

Lyndon's Ph.D. thesis concerned group cohomology;[1] the Lyndon–Hochschild–Serre spectral sequence, coming out of that work, relates a group's cohomology to the cohomologies of its normal subgroups and their quotient groups.

A Lyndon word is a string of symbols that is smaller, lexicographically, than any of its cyclic rotations; Lyndon introduced these words in 1954 while studying the bases of free groups.[4]

Lyndon was credited by Gustav A. Hedlund for his role in the discovery of the Curtis–Hedlund–Lyndon theorem, a mathematical characterization of cellular automata in terms of continuous equivariant functions on shift spaces.[5]

The Craig–Lyndon interpolation theorem in formal logic states that every logical implication can be factored into the composition of two implications, such that each nonlogical symbol in the middle formula of the composition is also used in both of the other two formulas. A version of the theorem was proved by William Craig in 1957, and strengthened by Lyndon in 1959.[6]

In addition to these results, Lyndon made important contributions to combinatorial group theory, the study of groups in terms of their presentations in terms of sequences of generating elements that combine to form the group identity.[1]

Books[edit]

Lyndon was the author or coauthor of the books:

  • Notes on Logic (Van Nostrand, 1967)
  • Word Problems: Decision Problem in Group Theory (with W. W. Boone and F.B. Cannonito, North-Holland, 1973)
  • Combinatorial Group Theory (with Paul Schupp, 1976, reprinted 2001 by Springer-Verlag, ISBN 978-3-540-41158-1)
  • Groups and Geometry (Cambridge University Press, 1985, ISBN 978-0-521-31694-1).

Awards and honors[edit]

The book Contributions to Group Theory (American Mathematical Society, 1984, ISBN 978-0-8218-5035-0) is a festschrift dedicated to Lyndon on the occasion of his 65th birthday; it includes five articles about Lyndon and his mathematical research, as well as 27 invited and refereed research articles.

The Roger Lyndon Collegiate Professorship of Mathematics at the University of Michigan, held by Hyman Bass since 1999,[7] is named after Lyndon.

References[edit]

  1. ^ a b c d e f g O'Connor, John J.; Robertson, Edmund F., "Roger Lyndon", MacTutor History of Mathematics archive, University of St Andrews ..
  2. ^ a b Roger Conant Lyndon at the Mathematics Genealogy Project.
  3. ^ Bannai, Eiichi; Griess, Robert L., Jr.; Praeger, Cheryl E.; Scott, Leonard (2009), "The mathematics of Donald Gordon Higman" (PDF), Michigan Math. J. 58 .
  4. ^ Berstel, Jean; Perrin, Dominique (2007), "The origins of combinatorics on words" (PDF), European Journal of Combinatorics 28 (3): 996–1022, doi:10.1016/j.ejc.2005.07.019, MR 2300777 .
  5. ^ Hedlund, G. A. (1969), "Endomorphisms and Automorphisms of the Shift Dynamical Systems", Mathematical System Theory 3 (4): 320–375, doi:10.1007/BF01691062 .
  6. ^ Troelstra, Anne Sjerp; Schwichtenberg, Helmut (2000), Basic Proof Theory, Cambridge tracts in theoretical computer science 43 (2nd ed.), Cambridge University Press, p. 141, ISBN 978-0-521-77911-1 .
  7. ^ Hyman Bass curriculum vitae, retrieved 2011-03-17.