Fred Galvin

William Frederick "Fred" Galvin ( born November 10, 1936 in St. Paul, Minnesota) is an American mathematician who is concerned with axiomatic set theory and combinatorics.

Galvin studied at the University of Minnesota- Minneapolis with a bachelor 's degree in 1958 and a master's degree in 1961. 1967 he was there with Bjarni Jonsson PhD ( Horn Sentences ). He was from 1965 to 1967 Instructor and 1967/68 Lecturer at the University of California, Berkeley, from 1968 assistant professor at the University of California, Los Angeles and in 1975 Associate Professor and in 1978 Professor at the University of Kansas.

In 1995 he proved the conjecture of Jeff Dinitz in combinatorics ( assisted by Jeannette Janssen ). In the infinite Ramsey theory he showed with Prikry that Borel sets have the Ramsey property.

He gave a simpler proof of the theorem by Andras Hajnal and James Baumgartner on a partition relation.

Writings

  • On a partition theorem of Baumgartner and Hajnal, in: Infinite and Finite Sets, Keszthely Colloquium, 1973, Volume 2, North Holland, 1975, pp. 711-729
  • Karel Prikry: Borel sets and Ramsey 's theorem, J. Symbolic Logic, Volume 38, 1973, p 193-198.
  • Generating countable sets of permutations, J. London Math Soc., Volume 51 1995, pp. 230-242.
  • The list chromatic index of a bipartite multi graph, J. Combin. Theory Ser. B, Volume 63, 1995, pp. 153-158 ( Dinitz conjecture )
  • Petr Simon: A Cech function in ZFC, Fundamenta Mathematica, Volume 193, 2007, pp. 181-188.
  • With Jean Larson: pinning countable ordinals, Fundamenta Mathematica, Volume 82, 1974/75, pp. 357-361
Saint Paul (Minnesota) Set theory#Axiomatic set theory András Hajnal James Earl Baumgartner Mathematics Genealogy Project
350715
de