scienceJan 15, 20258:28pending
OEIS A000103: Sphere Triangulations with Minimum Degree Four
About this episode
We explore A000103, the count of sphere triangulations where every vertex has degree at least four. We discuss why the initial terms are zero, the topological meaning of the degree constraint, and a six-node example built from a cube inscribed in a sphere that yields a valid triangulation. We also cover how SurfTri helps enumerate such configurations and how A000103 fits with related sequences like A000109 (all sphere triangulations) and A081621 (minimum degree five), highlighting the interconnected landscape of these OEIS entries.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
Get every episode summarized
Each time Intellectually Curious publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Intellectually Curious
Free Pause Tokens Solve AI Multitasking
Intellectually Curious
Sep 14, 20266:39failed
Claude’s Autonomous Formalization of Fermat’s Last Theorem
Intellectually Curious
Sep 13, 20266:48completed
Random Attention: How AI Gets Faster by Forgetting
Intellectually Curious
Sep 12, 20266:13completed
The Alien Anatomy of the Bigfin Squid
Intellectually Curious
Sep 11, 20265:48completed