An exploration of A000087, counting unrooted, non-separable planar maps with a distinguished face. We trace the bijection with beta-1 trees, explain primitive and multi-edge-free maps, and show how internal tree structure encodes map features like two-face counts. We’ll also connect these maps to permutations via decomposable/indecomposable constructions and mesh patterns, and touch on applications in computer science, physics (2D quantum gravity), and combinatorics. A journey through how one sequence links maps, trees, and patterns in surprising, interconnected ways.

Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.

Sponsored by Embersilk LLC