Combinatoric results for graphical enumeration and the higher Catalan numbers

Simple item page
dc.creatorPierce, V. U.
dc.date2007-03-06
dc.date.accessioned2026-07-07T07:50:27Z
dc.date.available2026-07-07T07:50:27Z
dc.descriptionWe summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared recently as an auxiliary function in enumerating maps and explicit computations of the asymptotic expansion of the partition function of random matrices in the unitary ensemble case. We give combinatoric proofs of the formulas for the number of genus 0 and genus 1 maps.
dc.description9 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0703160
dc.identifierhttp://arxiv.org/abs/math/0703160
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125169
dc.subjectCombinatorics
dc.titleCombinatoric results for graphical enumeration and the higher Catalan numbers
dc.typetext

Files

Collections

arXiv