István Fáry

István Fáry (30 June 1922 – 2 November 1984) was a Hungarian-born mathematician known for his work in geometry and algebraic topology.[1] He proved Fáry's theorem that every planar graph has a straight line embedding in 1948, and the Fary–Milnor theorem lower-bounding the curvature of a nontrivial knot in 1949.

István Fáry
Born(1922-06-30)30 June 1922
Gyula, Hungary
Died2 November 1984(1984-11-02) (aged 62)
El Cerrito, California
Alma materUniversity of Paris
Known forKnot theory
Scientific career
FieldsMathematics
InstitutionsUniversity of California, Berkeley
Doctoral advisorJean Leray

Biography

Fáry was born June 30, 1922 in Gyula, Hungary. After studying for a master's degree at the University of Budapest, he moved to the University of Szeged, where he earned a Ph.D. in 1947. He then studied at the Sorbonne before taking a faculty position at the University of Montreal in 1955. He moved to the University of California, Berkeley in 1958 and became a full professor in 1962. He died on November 2, 1984, in El Cerrito, California.[1]

Selected publications
  • Fáry, István (1948), "On straight-line representation of planar graphs", Acta Sci. Math. (Szeged), 11: 229–233, MR 0026311.
  • Fáry, István (1949), "Sur la courbure totale d'une courbe gauche faisant un nœud", Bulletin de la Société Mathématique de France, 77: 128–138.
gollark: https://meta.rpn.aidanpe.duckdns.org/dom.mjs
gollark: This doesn't seem very cheats, it's just got a bunch of extra RPNCalc definitions for button access.
gollark: I *always* have the right idea.
gollark: Just allow RPNCalc access to all DOM functions.
gollark: Everything should handle either one thing, no things, or n things. No weird "up to 7 things" like (*ugh*) Elm.

References
  1. S. S. Chern, R. J. DeVogelaere, and R. C. Kirby (1985), "Istvan Fary, Mathematics: Berkeley", University of California: In Memoriam, California Digital LibraryCS1 maint: multiple names: authors list (link).
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.