Heinz Prüfer

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Heinz Pruefer (1930).

Ernst Paul Heinz Pruefer (10 November 1896 – 7 April 1934) was a German Jewish mathematician born in Wilhelmshaven. His major contributions were on abelian groups, algebraic numbers, knot theory and Sturm–Liouville theory.

In 1915 he began his University studies in Mathematics, Physics and Chemistry in Berlin. After that he started his Doctorate degree with Issai Schur as his advisor at Humboldt-Universität Berlin. In 1921 he obtained his Doctorate degree. His thesis was named Unendliche Abelsche Gruppen von Elementen endlicher Ordnung (Infinite abelian groups of elements of finite order). This thesis set the road for his contributions on abelian groups. In 1922 he worked with mathematician Paul Kobe in University of Jena Friedrich-Schiller, and in 1923 he obtained tenure and was at this University until 1927. In that year he moved to Münster University where he worked until the end of his life. His final work was about Projective Geometry, but it was posthumously completed by his students Gustav Fleddermann and Gottfried Köthe.

Heinz Pruefer was married, but without children. He died prematurely with 37 years of age in 1934 in Münster Germany, due to lung cancer.

Mathematical Contributions[edit]

Heinz Pruefer created the following mathematical expressions which were later named after him:

References[edit]

  • Prüfer, Heinz; Fleddermann, Gottfried; Köthe, Projektive Geometrie. Aus dem Nachlaß herausgegeben von G. und G.. 2. unveränd. Aufl. VII + 314 S Leipzig 1935., Akademische Verlagsgesellschaft Geest u. Portig K. G. Preis geb. 9,–DM 
  • Halter-Hoch, Franz (2003), Characterization of Pruefer Multiplication Monoids and Domains by Means of Spectral Module Systems; Volume 139,19-31., Springer 
  • Jarden, Moshe (1975), "On Ideal Theory in High Prufer Domains", Manuscripta mathematica (Springer Verlag ISSN 0025-2611): 303–336 
  • Fontana, M; Huckaba, I; Papick (1996), Prüfer Domains. Pure and Applied Mathematics Books. 329 Pages; ISBN 0-8247-9816-3, Marcel Dekker Publishing, New York 
  • Kajimoto, H (2003), "An Extension of the Prüfer Code and Assembly of Connected Graphs from Their Blocks", Graphs and Combinatorics 19: 231–239 
  • Wang, L; Wu, Y (2009), "An Optimal Algorithm for Prufer Codes", Journal of Software Engineering and Applications 2 (2): 111–115, doi:10.4236/jsea.2009.22016 

External links[edit]