The $F$-triangle of the generalised cluster complex

Simple item page
dc.creatorKrattenthaler, Christian
dc.date2005-09-03
dc.date2006-02-09
dc.date.accessioned2026-07-07T06:42:55Z
dc.date.available2026-07-07T06:42:55Z
dc.descriptionThe $F$-triangle is a refined face count for the generalised cluster complex of Fomin and Reading. We compute the $F$-triangle explicitly for all irreducible finite root systems. Furthermore, we use these results to partially prove the "$M=F$ Conjecture" of Armstrong which predicts a surprising relation between the $F$-triangle and the Möbius function of his $m$-divisible partition poset associated to a finite root system.
dc.descriptionAmS-TeX, 30 pages; style of equation numbering changed to the style in the printed publication
dc.identifierhttps://arxiv.org/abs/math/0509063
dc.identifierhttp://arxiv.org/abs/math/0509063
dc.identifierin: "Topics in Discrete Mathematics," dedicated to Jarik Nesetril on the occasion of his 60th birthday, M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas and P. Valtr, eds., Springer-Verlag, Berlin, New York, 2006, pp. 93-126.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102223
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.subjectPrimary 05E15; Secondary 05A05 05A10 05A15 05A19 06A07 20F55 33C05
dc.titleThe $F$-triangle of the generalised cluster complex
dc.typetext

Files

Collections

arXiv