arXiv (All)
open access
Counting mobiles by integrable systems
Mobiles are a particular class of decorated plane trees which serve as codings for planar maps. Here we address the question of enumerating mobiles in their most general flavor, in correspondence with planar Eulerian (i.e., bicolored) maps. We show that the generating functions for such mobiles sati
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
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#924635
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#920403
- Subset selection problems in planar point sets#925735
- There is no Leech tree on 18 vertices, and no Leech spider of order at least five, with a leaf-deletion bound at order 25#664943
- Overcolored Partition $k$-tuples Restricted by Parity of the Parts#971899
Record · ID 987364
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