Search arXivSearch

arXiv · 2507.20003

Finite Interpretations of a Hyper-Catalan Series Solution to Polynomial Equations and Visualizations

Abstract

The solution to the general univariate polynomial equation has been sought for centuries. It is well known there is no general solution in radicals for degrees five and above. The hyper-Catalan numbers $C[m_2,m_3,m_4,\ldots]$ count the ways to subdivide a planar polygon into exactly $m_2$ triangles, $m_3$ quadrilaterals, $m_4$ pentagons, etc. Wildberger and Rubine (2025) show the generating series $\mathbf{S}$ of the hyper-Catalan numbers is a formal series zero of the general geometric polynomial (meaning, general except for a constant of $1$ and a linear coefficient of $-1$). Using a variant of the series solution to the geometric polynomial that has the number of vertices, edges, and faces explicitly shown, We prove their infinite series result may be viewed as a finite identity at each level, where a level is a truncation of $\mathbf{S}$ to a given maximum number of vertices, edges, or faces (bounded by degree). We illustrate this result, as well as the general correspondence between operations on sets of subdivided polygons and the algebra of polynomials, with figures and animations generated using Python.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pratham Mukewar. 2025-07-26. Finite Interpretations of a Hyper-Catalan Series Solution to Polynomial Equations and Visualizations. https://arxiv.org/abs/2507.20003

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO