The Chain Polynomials of Noncrossing Partition Lattices are Real-Rooted
Erwin Schrödinger International Institute for Mathematics and Physics (ESI) via YouTube
MIT Sloan: Lead AI Adoption Across Your Organization — Not Just Pilot It
Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a 19-minute mathematics lecture from the Workshop on "Recent Perspectives on Non-crossing Partitions through Algebra, Combinatorics, and Probability" at the Erwin Schrödinger International Institute that delves into the real-rootedness of chain polynomials in noncrossing partition lattices. Learn about the coefficients of chain polynomials in finite posets and their role in enumerating chains by element count. Discover proven results about noncrossing partition lattices associated with finite Coxeter groups and examine formulas for h-polynomials in irreducible cases, presented as collaborative research with Christos Athanasiadis and Theo Douvropoulos.
Syllabus
Katerina Kalampogia-Evangelinou - The chain polynomials of noncrossing partition lattices are...
Taught by
Erwin Schrödinger International Institute for Mathematics and Physics (ESI)