The Generalized Cluster Complex: Refined Enumeration of Faces and Related Parking Spaces

The generalized cluster complex was introduced by Fomin and Reading as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex, we associate a parabolic conjugacy class of the underlying finite Coxeter group. We...

Повний опис

Збережено в:
Бібліографічні деталі
Опубліковано в: :Symmetry, Integrability and Geometry: Methods and Applications
Дата:2023
Автори: Douvropoulos, Theo, Josuat-Vergès, Matthieu
Формат: Стаття
Мова:Англійська
Опубліковано: Інститут математики НАН України 2023
Онлайн доступ:https://nasplib.isofts.kiev.ua/handle/123456789/212015
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Цитувати:The Generalized Cluster Complex: Refined Enumeration of Faces and Related Parking Spaces. Theo Douvropoulos and Matthieu Josuat-Vergès. SIGMA 19 (2023), 069, 40 pages

Репозитарії

Digital Library of Periodicals of National Academy of Sciences of Ukraine
Опис
Резюме:The generalized cluster complex was introduced by Fomin and Reading as a natural extension of the Fomin-Zelevinsky cluster complex coming from finite type cluster algebras. In this work, to each face of this complex, we associate a parabolic conjugacy class of the underlying finite Coxeter group. We show that the refined enumeration of faces (respectively, positive faces) according to this data gives an explicit formula in terms of the corresponding characteristic polynomial (equivalently, in terms of Orlik-Solomon exponents). This characteristic polynomial originally comes from the theory of hyperplane arrangements, but it is conveniently defined via the parabolic Burnside ring. This makes a connection with the theory of parking spaces: our results eventually rely on some enumeration of chains of noncrossing partitions that were obtained in this context. The precise relations between the formulas counting faces and the one counting chains of noncrossing partitions are combinatorial reciprocities, generalizing the one between Narayana and Kirkman numbers.
ISSN:1815-0659