From Wikipedia, the free encyclopedia
American mathematician
Berkeley, 2013Michelle Lynn Wachs is an American mathematician who specializes in algebraic combinatorics and works as a professor of mathematics at the University of Miami.[1]
Wachs and her advisor Adriano Garsia are the namesakes of the Garsia–Wachs algorithm for optimal binary search trees, which they published in 1977.[2][A] She is also known for her research on shellings for simplicial complexes,[F] partially ordered sets,[C] and Coxeter groups,[B] and on random permutation statistics[E] and set partition statistics.[D]
Wachs earned her doctorate in 1977 from the University of California, San Diego, under the supervision of Adriano Garsia. Her dissertation was Discrete Variational Techniques in Finite Mathematics.[3]
In 2012 Wachs became one of the inaugural fellows of the American Mathematical Society.[4] In 2013 she and her husband, mathematician Gregory Galloway (the chair of the mathematics department at Miami) were recognized as Simons Fellows.[5] A conference in her honor was held in January 2015 at the University of Miami.[6]
Selected publications[edit] D. Wachs, Michelle; White, Dennis (1991), " p , q {\displaystyle p,q} -Stirling numbers and set partition statistics", Journal of Combinatorial Theory, Series A, 56 (1): 27–46, doi:10.1016/0097-3165(91)90020-H, MR 1082841 F. Björner, Anders; Wachs, Michelle L. (1996), "Shellable nonpure complexes and posets I", Transactions of the American Mathematical Society, 348 (4): 1299–1327, doi:10.1090/S0002-9947-96-01534-6, MR 1333388; Part II,
Trans. AMS349 (10): 3945–3975, 1997,
doi:
10.1090/S0002-9947-97-01838-2,
MR1401765RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4