Brown's theorem and its application for enumeration of dissections and planar trees

MaRDI QIDQ2256111zbMATH OpenFDO

Authors Evgeniy Krasko, Alexander V. Omelchenko

Publication date 19 February 2015

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p17

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

enumerationplanar dissectionsplane trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Review text

Summary: We present new functional equations connecting the counting series of plane and planar (in the sense of \textit{F. Harary} and \textit{E. M. Palmer} [Graphical enumeration. York-London: Academic Press (1973; Zbl 0266.05108)]) dissections. Simple rigorous expressions for counting symmetric \(r\)-dissections of polygons and planar \(S\)-dissections are obtained.

Recommendations

• scientific article; zbMATH DE number 4150199
• Publication:4206757
• scientific article; zbMATH DE number 3918402
• Counting polygon dissections in the projective plane
• Counting symmetry classes of dissections of a convex regular polygon

Cites work

• A Census of Planar Triangulations
• A classification of plane and planar 2-trees
• Analytic combinatorics
• Enumeration of Quadrangular Dissections of the Disk
• Enumeration of Triangulations of the Disk
• Enumerative combinatorics. Volume 2.
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3468863 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• On the cell-growth problem for arbitrary polygons
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• The number of trees
• Triangular Dissections of N-Gons
• Une théorie combinatoire des séries formelles

This page was built for publication: Brown's theorem and its application for enumeration of dissections and planar trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256111)