József Solymosi

József Solymosi is a Hungarian-Canadian mathematician and a professor of mathematics at the University of British Columbia. His main research interests are arithmetic combinatorics, discrete geometry, graph theory, and combinatorial number theory.[1]

József Solymosi at a Discrete Geometry Workshop, April 2017 in Oberwolfach.

Education and career

Solymosi earned his master's degree in 1999 under the supervision of László Székely from the Eötvös Loránd University[2] and his Ph.D. in 2001 at ETH Zürich under the supervision of Emo Welzl. His doctoral dissertation was Ramsey-Type Results on Planar Geometric Objects.[3]

From 2001 to 2003 he was S. E. Warschawski Assistant Professor of Mathematics at the University of California, San Diego. He joined the faculty of the University of British Columbia in 2002.[1]

He was editor in chief of the Electronic Journal of Combinatorics[4] from 2013 to 2015.

Contributions

Solymosi was the first online contributor to the first Polymath Project, set by Timothy Gowers to find improvements to the Hales–Jewett theorem.[5]

One of his theorems states that if a finite set of points in the Euclidean plane has every pair of points at an integer distance from each other, then the set must have a diameter (largest distance) that is linear in the number of points. This result is connected to the Erdős–Anning theorem, according to which an infinite set of points with integer distances must lie on one line.[6][ID] In connection with the related Erdős–Ulam problem, on the existence of dense subsets of the plane for which all distances are rational numbers, Solymosi and de Zeeuw proved that every infinite rational-distance set must either be dense in the Zariski topology or it must have all but finitely many of its points on a single line or circle.[7][EU]

With Terence Tao, Solymosi proved a bound of on the number of incidences between points and affine subspaces of any finite-dimensional Euclidean space, whenever each pair of subspaces has at most one point of intersection. This generalizes the Szemerédi–Trotter theorem on points and lines in the Euclidean plane, and because of this the exponent of cannot be improved. Their theorem solves (up to the in the exponent) a conjecture of Toth, and was inspired by an analogue of the Szemerédi–Trotter theorem for lines in the complex plane.[8][9][HD]

He has also contributed improved bounds for the Erdős–Szemerédi theorem, showing that every set of real numbers has either a large set of pairwise sums or a large set of pairwise products,[10][ME] and for the Erdős distinct distances problem, showing that every set of points in the plane has many different pairwise distances.[11][DD]

Recognition

In 2006, Solymosi received a Sloan Research Fellowship[12] and in 2008 he was awarded the André Aisenstadt Mathematics Prize.[13] In 2012 he was named a doctor of the Hungarian Academy of Science.[14]

Selected publications
DD.Solymosi, J.; Tóth, Cs. D. (2001), "Distinct distances in the plane", Discrete & Computational Geometry, 25 (4): 629–634, doi:10.1007/s00454-001-0009-z, MR 1838423
ID.Solymosi, József (2003), "Note on integral distances", Discrete & Computational Geometry, 30 (2): 337–342, doi:10.1007/s00454-003-0014-7, MR 2007970
ME.Solymosi, József (2009), "Bounding multiplicative energy by the sumset", Advances in Mathematics, 222 (2): 402–408, arXiv:0806.1040, doi:10.1016/j.aim.2009.04.006, MR 2538014
EU.Solymosi, Jozsef; de Zeeuw, Frank (2010), "On a question of Erdős and Ulam", Discrete & Computational Geometry, 43 (2): 393–401, doi:10.1007/s00454-009-9179-x, MR 2579704
HD.Solymosi, József; Tao, Terence (2012), "An incidence theorem in higher dimensions", Discrete & Computational Geometry, 48 (2): 255–280, arXiv:1103.2926, doi:10.1007/s00454-012-9420-x, MR 2946447
gollark: The edited communist manifesto from earlier was thingied on my GPU.
gollark: Anyway, based on my very rough testing, the GPU is about 4 times as fast as the CPU for my arbitrary NLP tasks.
gollark: Google has these TPU things, which are hyperspecialized for particular big parallel operations™ and have tons of memory bandwidth.
gollark: CPUs do a few fairly sequential and varied tasks quite fast; GPUs do big parallel boring ones extremely fast.
gollark: No, the majority of a GPU is just big SIMD things nowadays.

References
  1. Short curriculum vitae, retrieved 2018-09-08
  2. László Székely's Students, University of South Carolina, retrieved 2018-09-08
  3. József Solymosi at the Mathematics Genealogy Project
  4. "Editorial team", Electronic Journal of Combinatorics, retrieved 2018-09-08
  5. Nielsen, Michael (2012), Reinventing Discovery: The New Era of Networked Science, Princeton University Press, p. 1, ISBN 9780691148908
  6. Garibaldi, Julia; Iosevich, Alex; Senger, Steven (2011), The Erdős Distance Problem, Student Mathematical Library, 56, American Mathematical Society, Providence, RI, p. 16, ISBN 978-0-8218-5281-1, MR 2721878
  7. Tao, Terence (December 20, 2014), "The Erdős–Ulam problem, varieties of general type, and the Bombieri–Lang conjecture", What's New
  8. Guth, Larry (2016), Polynomial Methods in Combinatorics, University Lecture Series, 64, American Mathematical Society, Providence, RI, pp. 89–90, ISBN 978-1-4704-2890-7, MR 3495952
  9. Tao, Terence (March 17, 2011), "An incidence theorem in higher dimensions", What's New
  10. Tao, Terence (June 17, 2008), "The sum-product phenomenon in arbitrary rings", What's New
  11. Guth (2016, p. 83)
  12. Annual Report (PDF), Alfred P. Sloan Foundation, 2006, retrieved 2018-09-08
  13. "Solymosi and Taylor Awarded Aisenstadt Prize" (PDF), Mathematics People, Notices of the American Mathematical Society, 55 (2): 266, February 2008
  14. "Solymosi József", Az MTA köztestületének tagjai [Members of the public body of MTA] (in Hungarian), retrieved 2018-09-08
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.