Computing the 4D Geode
Combinatorics
2025-12-29 v1
Abstract
The closed form for the hyper-Catalan number C[m2,m3,m4,...], which counts the number of subdivisions of a roofed polygon into m2 triangles, m3 quadrilaterals, m4 pentagons, etc., has been known since 1940. In 2025, Wildberger and Rubine showed its generating series S[t2,t3,t4,...] is a zero of the general geometric univariate polynomial. They note the factorization S=(t2 + t3 + t4 + ...)G, where the factor G is called the Geode. Later in 2025, Amderberhan, Kauers and Zeilberger issued a challenge to compute G[1000,1000,1000,1000], the coefficient of in G. The reward is a donation to OEIS. We describe the computation, give the value and claim the reward.
Cite
@article{arxiv.2512.21785,
title = {Computing the 4D Geode},
author = {Dean Rubine},
journal= {arXiv preprint arXiv:2512.21785},
year = {2025}
}