---
title: Hyper-Catalan Numbers in Polygon Subdivisions
url: https://www.emergentmind.com/topics/hyper-catalan-numbers
type: topic
---

# Hyper-Catalan Numbers in Polygon Subdivisions

Searching arXiv for the cited papers to ground the article in current sources.
Hyper-Catalan numbers are a multivariate refinement of Catalan-type enumeration that count polygon subdivisions by prescribed face-type data and, simultaneously, furnish the coefficients of a formal power-series solution of the general geometric polynomial [2507.20003]. In the formulation developed by Wildberger and Rubine and extended in subsequent work, the basic coefficient \(C[m_2,m_3,m_4,\ldots]\) records the number of planar subdivisions of a roofed polygon into exactly \(m_2\) triangles, \(m_3\) quadrilaterals, \(m_4\) pentagons, and so on, with all diagonals non-crossing [2507.20003]. The same coefficients occur in the formal series \(\mathbf{S}\) satisfying
\[
0=1-\alpha+t_2\alpha^2+t_3\alpha^3+t_4\alpha^4+\cdots,
\]
so that hyper-Catalan numbers occupy a dual role in enumerative combinatorics and formal algebra [2507.20003]. The term, however, is not uniform across the literature: some papers use “hyper-Catalan” for the super Catalan numbers \(S(m,n)\) or \(T(m,n)\), while others apply it to multidimensional Catalan families [1403.5296].

## 1. Definition and closed form

In the polygon-subdivision framework, a type vector is
\[
\mathbf{m}=[m_2,m_3,m_4,\ldots],
\]
where \(m_k\) is the number of \((k+1)\)-gons appearing in the subdivision: \(m_2\) triangles, \(m_3\) quadrilaterals, \(m_4\) pentagons, and so forth [2507.20003]. The counted objects are subdigons: planar polygons with a distinguished edge called the roof, subdivided by non-crossing diagonals, together with a null subdigon \(|\) of type \([\ ]\) representing a single edge with no interior faces [2507.20003].

Wildberger and Rubine’s geometric-polynomial formula gives the closed form
\[
C[m_2,m_3,m_4,\ldots]
=
\frac{(2m_2+3m_3+4m_4+\cdots)!}
{(1+m_2+2m_3+\cdots)!\,m_2!\,m_3!\cdots},
\]
with only finitely many \(m_k\) nonzero [2507.20003]. The same formula is restated in later work using
\[
V(\mathbf{m})=2+\sum_{k\ge 2}(k-1)m_k,\quad
E(\mathbf{m})=1+\sum_{k\ge 2}k\,m_k,\quad
F(\mathbf{m})=\sum_{k\ge 2}m_k,
\]
so that
\[
C[\mathbf{m}]
=
\frac{(E(\mathbf{m})-1)!}{(V(\mathbf{m})-1)!\prod_{k\ge 2}m_k!},
\qquad
V(\mathbf{m})-E(\mathbf{m})+F(\mathbf{m})=1
\]
[2508.06739]. This form makes explicit the Euler-theoretic bookkeeping underlying the enumeration.

The classical Catalan numbers are recovered by restricting to triangles only. Setting \(m_2=n\) and \(m_k=0\) for \(k\ge 3\) yields
\[
C[n,0,0,\ldots]
=
\frac{(2n)!}{(n+1)!\,n!}
=
\frac{1}{n+1}\binom{2n}{n},
\]
so the ordinary Catalan sequence appears as a one-parameter slice of the hyper-Catalan array [2508.06739]. A plausible implication is that hyper-Catalan numbers should be viewed less as a single sequence than as a typed family interpolating among Catalan and Fuss-Catalan regimes.

## 2. Subdigons and the combinatorics of polygon subdivision

The combinatorial model is recursive. A non-null subdigon has a unique central polygon, namely the unsubdivided polygon containing the roof, and the remaining pieces are themselves subdigons attached along the non-roof sides [2507.20003]. This is encoded by operators \({}_k\), where
\[
{}_k(s_1,\ldots,s_k)
\]
forms a new subdigon whose central polygon is a \((k+1)\)-gon and whose \(k\) non-roof sides are glued to the roofs of \(s_1,\ldots,s_k\) in counterclockwise order [2507.20003].

If \(\psi(s)=t_2^{m_2}t_3^{m_3}t_4^{m_4}\cdots\) for a subdigon \(s\) of type \(\mathbf{m}\), then
\[
\psi({}_k(s_1,\ldots,s_k))=t_k\,\psi(s_1)\cdots\psi(s_k),
\]
because the operation adds one \((k+1)\)-gon and otherwise adds types componentwise [2507.20003]. Let \(S\) be the multiset of all subdigons. The recursive grammar is
\[
S=\ |\ +\ {}_2(S,S)+{}_3(S,S,S)+{}_4(S,S,S,S)+\cdots,
\]
which is the direct combinatorial source of the functional equation for the generating series [2507.20003].

This model clarifies the sense in which hyper-Catalan numbers generalize Catalan triangulations. Classical Catalans count subdivisions into triangles only; hyper-Catalans count subdivisions into arbitrary polygon sizes with the full type vector retained [2507.20003]. Later work also relates powers \(\mathbf{S}^r\) to subdigons with prescribed central \((r+1)\)-gons, so the central polygon itself becomes a refined statistic rather than merely part of a recursive proof device [2508.06739].

## 3. Generating series and the geometric polynomial

The generating series is
\[
\mathbf{S}
=
\sum_{m_2,m_3,\ldots\ge 0}
C[m_2,m_3,\ldots]\,
t_2^{m_2}t_3^{m_3}t_4^{m_4}\cdots.
\]
Applying the subdigon grammar under \(\psi\) gives
\[
\mathbf{S}
=
1+t_2\mathbf{S}^2+t_3\mathbf{S}^3+t_4\mathbf{S}^4+\cdots,
\]
equivalently
\[
0=1-\mathbf{S}+t_2\mathbf{S}^2+t_3\mathbf{S}^3+t_4\mathbf{S}^4+\cdots
\]
[2507.20003]. Thus \(\mathbf{S}\) is a formal power-series zero of the general geometric polynomial.

The point is algebraic rather than analytic. The identity holds in the formal power-series ring, so no convergence hypothesis is required [2507.20003]. This suggests a universal formal solution to the geometric polynomial, with the hyper-Catalan coefficients encoding the full substitution algebra.

Subsequent work emphasizes that the coefficients of \(\mathbf{S}^r\) admit their own closed forms and combinatorial interpretations. Writing
\[
\mathbf{S}^r=\sum_{\mathbf{m}} C^{(r)}[\mathbf{m}]\,t^\mathbf{m},
\]
one has
\[
C^{(r)}[\mathbf{m}]
=
\frac{r\,(r-2+E(\mathbf{m}))!}
{(r-2+V(\mathbf{m}))!\prod_{k\ge 2}m_k!},
\]
and these coefficients count subdigons whose central polygon is an \((r+1)\)-gon after a corresponding type shift [2508.06739]. The same paper identifies these coefficients with Raney’s multivariate list-of-words counts in the case without unary nodes [2508.06739].

## 4. Layered variants and finite interpretations

A central refinement is the layered series that records vertices, edges, and faces explicitly. With
\[
F=m_2+m_3+m_4+\cdots,\quad
V=2+m_2+2m_3+3m_4+\cdots,\quad
E=1+2m_2+3m_3+4m_4+\cdots,
\]
the layered geometric polynomial is
\[
h(x)=1-x+\sum_{k\ge 2}v^{k-1}e^k f\,t_k x^k,
\]
and the corresponding layered series is obtained by the substitution \(t_k\mapsto t_k v^{k-1}e^k f\) in the original hyper-Catalan series [2507.20003]. The result is
\[
\mathbf{S}_L
=
\sum_{\mathbf{m}\ge 0}
C[\mathbf{m}]\,
t^\mathbf{m}v^{V-2}e^{E-1}f^F,
\]
and it satisfies
\[
h(\mathbf{S}_L)=0
\]
as a formal series [2507.20003].

The new contribution of the finite-interpretation papers is that these infinite identities can be truncated by bounded vertex, edge, or face level and still remain valid modulo the corresponding power of the layering variable [2507.20003]. For example, if one keeps only terms with \(V-2\le d\), then the resulting truncated series is still a root of the layered polynomial modulo \(v^{d+1}\). Analogous statements hold for edge layers and, with degree bounds, for face layers [2507.20003].

This finite-level viewpoint was extended to powers of the series. The later paper shows that the same philosophy applies to \(\mathbf{S}^r\), recounts Raney’s combinatorial derivation of the coefficients, and interprets the formal series zero as a hierarchy of finite identities at bounded vertex, edge, or face levels [2508.06739]. A plausible implication is that the hyper-Catalan series is not merely an abstract formal object but a systematically truncatable combinatorial device.

## 5. Recurrences, the Geode, and special identities

The series equation yields a hyper-Catalan recurrence that generalizes the ordinary Catalan convolution. Coefficient extraction from
\[
1-\mathbf{S}+t_2\mathbf{S}^2+t_3\mathbf{S}^3+\cdots=0
\]
expresses \(C[\mathbf{m}]\) as a sum over vector partitions of \(\mathbf{m}-\vec{j}\) into \(j\) parts, weighted by multinomial coefficients and products of smaller hyper-Catalan numbers [2507.04552]. In the one-variable triangle-only slice, this reduces to the familiar Catalan convolution [2507.04552].

Wildberger also noted the factorization
\[
\mathbf{S}-1=(t_2+t_3+t_4+\cdots)\mathbf{G},
\]
where \(\mathbf{G}\) is called the Geode [2507.04552]. Writing
\[
\mathbf{G}=\sum_{\mathbf{m}}G[\mathbf{m}]\,t^\mathbf{m},
\]
one obtains a “lesser sum” identity:
\[
C[\mathbf{m}]=\sum_{\mathbf{l}\in L(\mathbf{m})}G[\mathbf{l}],
\]
where \(L(\mathbf{m})\) consists of the type vectors obtained by subtracting \(1\) from one nonzero component of \(\mathbf{m}\) [2507.04552]. This in turn yields a Geode recurrence expressing \(G[\mathbf{m}]\) in terms of one larger hyper-Catalan number and smaller Geode coefficients [2507.04552].

The same paper proves three conjectures of Wildberger concerning special Geode values and shows that each Geode coefficient can be expanded as an integer combination of hyper-Catalans, although no closed form for the general Geode coefficient is known and its combinatorial meaning remains unknown [2507.04552]. This is one of the few explicit open problems attached to the current theory.

## 6. Terminology, related families, and scope

The phrase “hyper-Catalan numbers” is not terminologically stable. In the polygon-subdivision literature it denotes the multivariate array \(C[m_2,m_3,m_4,\ldots]\) described above [2507.20003]. But in other parts of the literature the same phrase is used for the super Catalan numbers
\[
S(m,n)=\frac{(2m)!(2n)!}{m!\,n!\,(m+n)!},
\qquad
T(m,n)=\frac{S(m,n)}{2},
\]
or their \(q\)-analogues, with the term “super Catalan” preferred by some authors and “hyper-Catalan” noted as a variant [1403.5296]. Elsewhere, “hyper-Catalan” can also refer more broadly to multidimensional Catalan families, signature Catalan structures, or hypergraph Catalan generalizations; these are distinct constructions, not equivalent reformulations of the polygon-subdivision numbers.

Within the polygonal framework itself, the relations to classical Catalan families are precise. Restricting to triangles recovers ordinary Catalans; restricting to a single polygon size yields Fuss-Catalan numbers [2508.06739]. More broadly, the same coefficients are linked in the cited papers to typed plane trees, noncrossing subdivisions, and Raney-style word enumerations [2508.06739].

This suggests a useful editorial distinction. In the narrow sense relevant to the 2025 geometric-polynomial program, hyper-Catalan numbers are the typed coefficients of the series zero \(\mathbf{S}\). In the broader historical sense, the term is overloaded and may denote unrelated Catalan generalizations [1403.5296]. Any technical use therefore depends on the ambient paper.

## 7. Computational and visual aspects

The 2025 work includes figures and animations generated using Python to illustrate the subdigon operations and the decomposition into central polygon plus attached subdigons [2507.20003]. The described workflow is: identify the unique decomposition \({}_k(s_1,\ldots,s_k)\), visualize the central \((k+1)\)-gon above the attached subdigons, merge them, and morph the resulting subdivision to a regular polygon by coordinate interpolation [2507.20003]. These visualizations are not part of the formal theory, but they make explicit the correspondence between polygon gluing and multiplication by \(t_k\mathbf{S}^k\).

A plausible implication is that the recursive geometry of subdigons is unusually well suited to computational experimentation. The finite-interpretation theorems reinforce that point: truncations by bounded vertex, edge, or face level yield finite expressions that still satisfy the polynomial identity to the corresponding order [2507.20003]. This makes the formal series tractable for explicit symbolic and graphical study even when the full object is infinite.

In current usage grounded in the polygon-subdivision literature, hyper-Catalan numbers form a multivariate Catalan refinement with an explicit factorial formula, a recursive combinatorial model via subdigons, a generating series \(\mathbf{S}\) that is a formal zero of the general geometric polynomial, finite layered truncations that remain valid at every level, and associated recurrences for both the coefficients and the Geode factor [2507.20003]. Their general coefficient array is explicit; their higher-power coefficients are explicit; but the general Geode coefficients still lack a closed form and a direct counting interpretation [2507.04552].

Source: https://www.emergentmind.com/topics/hyper-catalan-numbers