Joseph Gallian

Joseph Anthony Gallian ( born January 5, 1942 in Pennsylvania) is an American mathematician who deals with combinatorics and algebra and is known as a mathematics teacher.

Life

Gallian grew up in New Kensington in Pittsburgh and studied at the Slippery Rock State University with a bachelor's degree in 1966 from the University of Kansas ( master's degree, 1968) and in 1971 at the University of Notre Dame at Karl Kronstein PhD ( Two - step centralizers in finite p- groups). After a year as a visiting assistant professor at the University of Notre Dame in 1972 he was assistant professor and in 1980 professor at the University of Minnesota Duluth.

In 1977 he founded the Research Experience for Undergraduates ( REU) program at his university, which served as a model for other such programs in the United States. Its aim is to provide students to make problems they. In a kind of mini - Ph.D Address program and which frequently result in publications ( in twenty years came at about 170 participants 150 publications received). Focus were there ( according to the expertise of Gallian ) initially finite groups and Cayley graphs.

1999 to 2001 he was Polya Lecturer of the Mathematical Association of America ( MAA). 2007/ 08 he was president of the MAA. In 2013 he became a Fellow of the American Mathematical Society. He is also in the advisory board of Math Horizons ( the journal for undergraduates of the MAA ) and a director of the Project NExT the MAA for the training of postdoctoral fellows.

He was co-editor of Mathematics Magazine and American Mathematical Monthly.

In 2003, he was Minnesota Professor of the Year of the Carnegie Foundation for the Advancement of Teaching. In 1977 he received the Award of the MAA Allendoerfer ( for Finite Simple Groups The Search for ) and 1996 Trevor Evans Award of the MAA ( for Weird Dice ).

In his spare time he is a collector of Beatles memorabilia.

Writings

  • Contemporary Abstract Algebra, Brooks / Cole, 7th edition 2010
  • Publisher Mathematics and Sports, MAA 2010
  • A dynamic survey of graph labeling, Electronic J. of Combinatorics 2010
  • With S. Curran: Hamiltonian cycles and paths in Cayley graphs and digraphs - a survey, Discrete Mathematics, Volume 156, 1996, pp. 1-18
  • Error detection methods, ACM Computing Surveys, Volume 28, 1996, pp. 504-517
451857
de