John Stembridge
John Stembridge is a Professor of Mathematics at University of Michigan.[1] He received his Ph.D. from Massachusetts Institute of Technology in 1985 under the direction of Richard P. Stanley. His dissertation was called Combinatorial Decompositions of Characters of SL(n,C).[2]
He is one of the participants in the Atlas of Lie Groups and Representations.[3]
Research
His research interests are in combinatorics, with particular emphasis on the following areas:
- Topics related to algebra, especially representation theory
- Coxeter groups and root systems
- Enumerative combinatorics
- Symmetric functions
- Hypergeometric series and q-series
- Computational problems and algorithms in algebra
He was awarded a Guggenheim Fellowship in 2000 for work in Combinatorial aspects of root systems and Weyl characters..
He has written Maple packages that can be used for computing symmetric functions, posets, root systems, and finite Coxeter groups.[4]
gollark: So I think it's always just got a task running which waits for the *next* one.
gollark: Secondly, running one task per reminder would be very inefficient.
gollark: Firstly, you have to persist reminders too in case of bot outages.
gollark: It's more complex than that. I checked.
gollark: It is more complicated and thus more brittle.
References
- home page at University of Michigan
- Mathematics Genealogy Project
- http://www.liegroups.org/people/
- http://www.math.lsa.umich.edu/~jrs/maple.html
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.