arXiv (All)
open access
Generating functions of hypermaps and m-constellations with two alternating boundaries
We study the enumeration of planar hypermaps with several alternating boundaries. We first derive a peeling recursion with an arbitrary number of alternating boundaries and, in the two- boundary case, translate it into a functional equation for the corresponding generating function. Our main result
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Counting Graph Homomorphisms in Bipartite Settings#1248281
- "A solution to the semi-simplicial types problem in HoTT"#30164
- "A solution to the semi-simplicial types problem in HoTT"#30163
- Two-disjoint-cycle-cover edge bipancyclicity of bipartite generalized hypercubes#1048426
- On the chromatic number of pseudohemisphere hypergraphs#1144505
Record · ID 1386469
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive