Counting partitions of a fixed genus (Q1627201)

From MaRDI portal
Revision as of 10:49, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Counting partitions of a fixed genus
scientific article

    Statements

    Counting partitions of a fixed genus (English)
    0 references
    0 references
    0 references
    22 November 2018
    0 references
    Summary: We show that, for any fixed genus \(g\), the ordinary generating function for the genus \(g\) partitions of an \(n\)-element set into \(k\) blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a primitive partition and that the number of primitive partitions of a given genus is finite. We illustrate our method by finding the generating function for genus \(2\) partitions, after identifying all genus \(2\) primitive partitions, using a computer-assisted search.
    0 references
    set partitions
    0 references
    noncrossing partitions
    0 references
    genus of a hypermap
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references