Jump to content

Adriano Garsia

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Benjamin1995a (talk | contribs) at 10:19, 8 September 2022. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

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]

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.[citation needed]

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

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