Adriano Garsia

Adriano Mario Garsia (born 20 August 1928) is a Tunisian-born Italian American mathematician who works in 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 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, Garsia moved to Rome in 1946.[2]

As of 2018 he had 34 students and 152 descendants, according to the data at the Mathematics Genealogy Project, and was on the faculty of the University of California, San Diego.

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

Books by A. Garsia
  • Garsia, Adriano M., Martingale inequalities: Seminar notes on recent progress, Mathematics Lecture Notes Series, W. A. Benjamin, Inc., Reading, Mass.-London-Amsterdam, 1973. MR0448538
  • Garsia, Adriano M. (1970). Topics in almost everywhere convergence. Lectures in Advanced Mathematics. 4. Chicago, Ill: Markham Publishing Co. MR 0261253.
  • 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.

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. http://math.ucsd.edu/~garsia/cv.html
  3. List of Fellows of the American Mathematical Society, retrieved 2013-01-19.


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