Adriano Garsia

Adriano Mario Garsia (born 20 August 1928) is a Tunisian-born Italian American mathematician who works in analysis, combinatorics, representation theory, and algebraic geometry. He is a student of Charles Loewner and has published work on representation theory, symmetric functions, and algebraic combinatorics. He and Mark Haiman made the N!_conjecture. He is also the namesake of the Garsia–Wachs algorithm for optimal binary search trees, which he published with his student Michelle L. Wachs in 1977.[1]

Adriano Garsia
Born (1928-08-20) 20 August 1928
Tunis, French Tunisia
NationalityAmerican
Alma materStanford University
Scientific career
FieldsMathematics
InstitutionsUniversity of California, San Diego
Doctoral advisorCharles Loewner
Doctoral students

Born to Italian Tunisians in Tunis on 20 August 1928, Garsia moved to Rome in 1946.[2]

As of 2023, he had 36 students and at least 200 descendants, according to the data at the Mathematics Genealogy Project. He was on the faculty of the University of California, San Diego.[3] He retired in 2013 after 57 years at UCSD as a founding member of the Mathematics Department. At his 90 Birthday Conference in 2019, it was notable that he was the oldest principal investigator of a grant from the National Science Foundation in the country.[4]

In 2012, he became a fellow of the American Mathematical Society.[5]

Books by A. Garsia
  • Adriano M. Garsia, Topics in Almost Everywhere Convergence, Lectures in Advanced Mathematics Volume 4, Markham Publishing Co., Chicago, Ill., 1970. MR0261253
  • Adriano M. Garsia, Martingale inequalities: Seminar Notes on Recent Progress, Mathematics Lecture Notes Series, W. A. Benjamin, Inc., Reading, Mass.-London-Amsterdam, 1973. MR0448538
  • Adriano M. Garsia and Mark Haiman, Orbit Harmonics and Graded Representations, Research Monograph, to appear as part of the collection published by the Laboratoire de Combinatoire et d'Informatique Mathématique, edited by S. Brlek, Université du Québec à Montréal.
  • Adriano M. Garsia and Ömer Eğecioğlu, Lessons in Enumerative Combinatorics, Graduate Texts in Mathematics 290, Springer Nature, Switzerland AG, 2021. ISBN 978-3-030-71249-5. MR4268536

References
  1. Knuth, Donald E. (1998), "Algorithm G (Garsia–Wachs algorithm for optimum binary trees)", The Art of Computer Programming, Vol. 3: Sorting and Searching (2nd ed.), Addison–Wesley, pp. 451–453. See also History and bibliography, pp. 453–454.
  2. "C.V. of Adriano Garsia". math.ucsd.edu. Retrieved 1 June 2023.
  3. "Emeriti Faculty | Department of Mathematics". math.ucsd.edu. Retrieved 1 June 2023.
  4. "Garsiafest". sites.google.com. Retrieved 1 June 2023.
  5. List of Fellows of the American Mathematical Society, Retrieved 19 January 2013.


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