Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Hans Zassenhaus

Modern

Hans Zassenhaus (1912 to 1991) was a German mathematician known for work in many parts of abstract algebra and as a pioneer of computer algebra. Born in Koblenz, he grew up in Hamburg, where he studied under Emil Artin and took his doctorate in 1934 with a thesis on doubly transitive permutation groups, now called Zassenhaus groups, which have had a deep impact on the classification of finite simple groups. While still a student he proved the butterfly lemma, a refinement of normal chains that is also named after him, and he wrote the textbook Lehrbuch der Gruppentheorie, later translated as Theory of Groups. After the Second World War he joined McGill University, where he supervised Joachim Lambek, then taught at the University of Notre Dame and, from 1965 until his retirement in 1982, at Ohio State University. He served as editor in chief of the Journal of Number Theory from its first issue in 1967.

Facts
Biography
Gender
Male 1
Birth Year
1912 1
Connections

In Branch

Source Hans Zassenhaus (Wikipedia)
Source Hans Zassenhaus (Wikipedia)

Mentored

Source Joachim Lambek (Wikipedia)

Mentored By

Source MacTutor History of Mathematics: Hans Julius Zassenhaus
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Hans Zassenhaus (Wikipedia)Lead
Quote, Lead
was a German mathematician
Sources
1. MacTutor History of Mathematics: Hans Julius Zassenhaus
MacTutor History of Mathematics
  • Quick Info, Born
    28 May 1912
  • Biography
    At first he studied mathematics and physics
View the Source
Hans Zassenhaus (Wikipedia)
  • Lead
    was a German mathematician
  • In Branch: Group Theory, Biography
    When just 21, Zassenhaus was studying composition series in group theory.
View the Source
Joachim Lambek (Wikipedia)
Mentored: Joachim Lambek, Lead
Quote, Mentored: Joachim Lambek, Lead
with Hans Zassenhaus as advisor
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.