Polygon dissections and Euler, Fuss, Kirkman and Cayley numbers

Simple item page
dc.creatorPrzytycki, Jozef H.
dc.creatorSikora, Adam S.
dc.date1998-11-13
dc.date.accessioned2026-07-07T05:26:51Z
dc.date.available2026-07-07T05:26:51Z
dc.descriptionWe give a short proof for a formula for the number of divisions of a convex (sn+2)-gon along non-crossing diagonals into (sj+2)-gons, where 1<=j<=n-1. In other words, we consider dissections of an (sn+2)-gon into pieces which can be further subdivided into (s+2)-gons. This formula generalizes the formulas for classical numbers of polygon dissections: Euler-Catalan number, Fuss number and Kirkman-Cayley number. Our proof is elementary and does not use the method of generating functions.
dc.description9 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/9811086
dc.identifierhttp://arxiv.org/abs/math/9811086
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77710
dc.subjectCombinatorics
dc.subject05A
dc.titlePolygon dissections and Euler, Fuss, Kirkman and Cayley numbers
dc.typetext

Files

Collections

arXiv