Search
Workshop

Colored multiset Eulerian polynomials via products of simplices

  • Danai Deligeorgaki (Universitat de Barcelona)
E1 05 (Leibniz-Saal)

Abstract

This talk explores a family of polynomials arising from descent statistics on colored permutations of multisets. They generalize the colored Eulerian polynomials that appear frequently in algebraic combinatorics and are known to admit desirable distributional properties, including real-rootedness, log-concavity, unimodality and the alternatingly increasing property. In joint work with Bin Han and Liam Solus, we prove that a large class of colored multiset Eulerian polynomials obtains all of the aforementioned distributional properties as well as others, including bi-gamma-positivity. The proof relies on a connection to convex polytopes: colored multiset Eulerian polynomials arise in lattice point enumeration considerations for products of simplices, enabling the use of polyhedral methods to establish our results.

Saskia Gutzschebauch

Max Planck Institute for Mathematics in the Sciences Contact via Mail

Mirke Olschewski

Max Planck Institute for Mathematics in the Sciences Contact via Mail

Akihiro Higashitani

Osaka University

Hidefumi Ohsugi

Kwansei Gakuin University

Irem Portakal

Max Planck Institute for Mathematics in the Sciences