Fred Galvin

Frederick William "Fred" Galvin (born November 10, 1936 in St. Paul , Minnesota ) is an American mathematician who deals 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. In 1967 he received his doctorate there with Bjarni Jonsson (Horn Sentences). From 1965 to 1967 he was instructor and 1967/68 lecturer at the University of California, Berkeley , from 1968 assistant professor at the University of California, Los Angeles and from 1975 associate professor and from 1978 professor at the University of Kansas .

In 1995 he proved Jeff Dinitz's conjecture in combinatorics (based on preliminary work 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 András Hajnal and James Baumgartner's theorem about a partition relation.

Fonts

On a partition theorem of Baumgartner and Hajnal, in: Infinite and Finite Sets, Colloquium Keszthely, 1973, Volume 2, North Holland 1975, pp. 711-729
with Karel Prikry : Borel sets and Ramsey's theorem, J. Symbolic Logic, Volume 38, 1973, pp. 193-198.
with Andras Hajnal: Inequalities for cardinal powers, Annals of Mathematics, Volume 101, 1975, pp. 491-498.
Generating countable sets of permutations, J. London Math. Soc., Vol. 51 1995, pp. 230-242.
The list chromatic index of a bipartite multigraph, J. Combin. Theory Ser. B, Volume 63, 1995, pp. 153-158 (Dinitz assumption)
with Petr Simon: A Čech 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

↑ Life data according to American Men and Women of Science , Thomson Gale 2004
↑ Fred Galvin in the Mathematics Genealogy Project (English)
↑ Published in Ann. Math. Logic, Vol. 1, 1970, pp. 389-422
↑ See Aigner, Ziegler The Book of Evidence , Chapter 33