Jump to content

Stanisław Świerczkowski

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Charleswallingford (talk | contribs) at 16:56, 23 April 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Stanisław Świerczkowski
Born(1932-07-16)July 16, 1932
DiedSeptember 30, 2015(2015-09-30) (aged 83)
NationalityPolish
Alma materUniversity of Wroclaw, Glasgow University, University of Sussex, Sultan Qaboos University, Australian National University
Known forThree-Distance Theorem, Non-Tetratorus Theorem
Children1 son, 1 daughter
AwardsFoundation of Alfred Jurzykowski (1996)[1]
Scientific career
FieldsMathematics
InstitutionsUniversity of Wroclaw, Cornell University
Doctoral advisorHugo Steinhaus
Doctoral studentsRobert Walters

Stanisław (Stash) Świerczkowski (July 16, 1932 – September 30, 2015) was a Polish mathematician famous for his solutions to two iconic problems posed by Hugo Steinhaus: the Three-Distance (or Three-Gaps) Theorem and the Non-Tetratorus Theorem.

Early life and education

Stanisław (Stash) Świerczkowski was born in Toruń, Poland. His parents were divorced during his infancy. When war broke out his father was captured in Soviet-controlled Poland and murdered in the 1940 Katyń Massacre. He belonged to the Polish nobility; Świerczkowski's mother belonged to the upper middle class and would have probably suffered deportation and murder by the Nazis. However she had German connections and was able to gain relatively privileged class 2 Volksliste citizenship. At the end of the war Świerczkowski's mother was forced into hiding near Toruń until she was confident that she could win exoneration from the Soviet-controlled government for her Volksliste status and be rehabilitated as a Polish citizen. Meanwhile Świerczkowski lived in a rented room in Toruń and attended school there.

Świerczkowski won a university place to study astronomy at the University of Wrocław but switched to mathematics to avoid the drudgery of astronomical calculations. He discovered a natural ability through his friendship with Jan Mycielski and was able to remain at Wrocław to complete his masters under Jan Mikusiński. He graduated with a PhD in 1960, his dissertation including the now-famous Three-Distance Theorem which he proved in 1956 in answer to a question of Hugo Steinhaus.

Noted Mathematical Results

The Three-Distance (or Three-Gaps) Theorem[2] says: take arbitrarily many integer multiples of an irrational number between zero and one and plot them as points around a circle of unit circumference; then at most three different distances will occur between consecutive points. This answered a question of Hugo Steinhaus. The theorem belongs to the field of Diophantine approximation since the smallest of the three distances observed may be used to give a rational approximation to the chosen irrational number. It has been extended and generalized in many ways[3].

The Non-Tetratorus Theorem, published by in 1958[4] says that it is impossible to construct a closed chain (torus) of regular tetrahedra, placed face to face. Again this answered a question of Hugo Steinhaus. The result is attractive and counter-intuitive since the tetrahedron is unique among the Platonic solids to have this property. Recent work [5] by Michael Elgersma and Stan Wagon has sparked new interest in this result by showing that, experimentally, one can create chains of tetrahedra which are arbitrarily close to be being closed.

Career

He was then with the mathematics department at the RAND Corporation until 1971 when he moved to Cornell University as the Maxwell Upson Professor of Engineering. He remained at Cornell until he committed suicide in 1976.

Fulkerson was the supervisor of Jon Folkman at RAND and Tatsuo Oyama[1] at GRIPS [2].

In 1956, he published his noted paper on the Ford–Fulkerson algorithm[6] together with L.R. Ford, Jr.. In 1979, the renowned Fulkerson Prize was established which is now awarded every three years for outstanding papers in discrete mathematics jointly by the Mathematical Programming Society and the American Mathematical Society.



References

  1. ^ Jerzy Krzywicki (2000). "Nagrody Fundacji Jurzykowskiego w matematyce" (PDF). Roczniki Polskiego Towarzystwa Matematycznego Seria II: Wiadomo Sci Matematyczne XXXVI. 73: 115–138.
  2. ^ Three-Distance Theorem at Theorem of the Day
  3. ^ Alessandri,P. and Berthé, V. (1998). "Three distance theorems and combinatorics on words". L'Enseignement Mathématique. 44: 103–132.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  4. ^ Świerczkowski, S. (1958). "On a free group of rotations of the Euclidean space". Indagationes Mathematicae. 61: 376-378\url=http://www.sciencedirect.com/science/article/pii/S1385725858500511.
  5. ^ Elgersma ,M. and Wagon, S. (2015). "Closing a Platonic gap". The Mathematical Intelligencer. 37, no. 1: 54–61.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  6. ^ L. R. Ford; D. R. Fulkerson (1962). Flows in Networks. Princeton, NJ: Princeton University Press.