Vera T. Sós

Vera T. Sós (born September 11, 1930) is a Hungarian mathematician, specializing in number theory and combinatorics. She was a student and close collaborator of both Paul Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál Turán, the analyst, number theorist, and combinatorist (the letter T in her name stands for Turán[1]). Until 1987, she worked at the Department of Analysis at the Eötvös Loránd University, Budapest. Since then, she has been employed by the Alfréd Rényi Institute of Mathematics.[2] She was elected a corresponding member (1985), member (1990) of the Hungarian Academy of Sciences.[3] In 1997, Sós was awarded the Széchenyi Prize.

The native form of this personal name is T. Sós Vera. This article uses Western name order when mentioning individuals.
Vera T. Sós
Born (1930-09-11) September 11, 1930
Budapest, Hungary
NationalityHungarian
Alma materEötvös Loránd University.
AwardsTibor Szele Medal 1974), Academic Award (1983), Széchenyi Prize (1997), Cross of the Hungarian Order of Merit (2002), elected to Academia Europaea (2013)
Scientific career
FieldsMathematics
InstitutionsEötvös Loránd University
Doctoral students

One of her results is the Kővári–Sós–Turán theorem concerning the maximum possible number of edges in a bipartite graph that does not contain certain complete subgraphs. Another is the following so-called friendship theorem proved with Paul Erdős and Alfréd Rényi: if, in a finite graph, any two vertices have exactly one common neighbor, then some vertex is joined to all others. In number theory, Sós proved the three-gap theorem, conjectured by Hugo Steinhaus and proved independently by Stanisław Świerczkowski.

Life and career

Vera Sós is the daughter of a school teacher. As an adolescent, Sós attended the Abonyi Street Jewish highschool in Budapest and graduated in 1948. She was later introduced to Alfréd Rényi and Paul Erdős, who she later collaborated with, by her teacher Tibor Gallai. (Together she and Erdős have thirty joint papers.) Sós considered Gallai to be the person who discovered her gift for mathematics. Sós was also one of three girls out of all the girls in Gallai's class that became a mathematician. Sós later attended Eötvös Loránd University. There, she studied as a mathematics and physics major and graduated in 1952. Although she was still a student, Sós taught at Eötvös University in 1950. At the age of twenty, Sós attended a Mathematical Congress in Budapest, Hungary and attended a summer internship. Sós met her husband and collaborator Paul Turán in college. They married in 1952. The two had two children in 1953 and 1960, Gyorgy and Thomas Turan.[4] Turán died in September 1976.

In 1965, Sós began the weekly Hajnal–Sós seminar at the Mathematical Institute of the Hungarian Academy for Science with András Hajnal. The seminar is considered to be a "forum for new results in combinatorics."[5] This weekly seminar continues to this day.

Throughout her years working in mathematics, Sós has been honored with many awards as a result of her work. One of the many awards includes the Széchenyi Prize, which she received in 1997. The Széchenyi Prize is an award given to those who have greatly contributed to the academic life of Hungary.

Awards

Selected publications
  • ——— (1958). "On the distribution mod 1 of the sequence nα". Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 1: 127–134.
  • ———; Kövari, T.; Turán, P. (1954). "On a problem of K. Zarankiewicz". Colloquium Math. 3: 50–57. doi:10.4064/cm-3-1-50-57. MR 0065617.

Notes
  1. An interview with Vera Sós in Természet Világa
  2. List of research fellows of the Rényi Institute, retrieved 2010-01-23.
  3. Membership listing , Hungarian Academy of Sciences, retrieved 2010-01-23.
  4. Background Information Archived February 7, 2007, at the Wayback Machine on Sós (on pages 19–22)
  5. Same as Note 4 Archived February 7, 2007, at the Wayback Machine
  6. List of awards given to Vera T. Sós
gollark: See, Terra? JS is everywhere and you can never escape.
gollark: ARM is catching up, but it's... basically CISC now.
gollark: I mean, arguably CISC is faster because the big CPU companies do CISC and optimize it more.
gollark: Not *necessarily*.
gollark: No.

References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.