Search arXivSearch

arXiv · 2606.31526

The number of labeled partial orders and topologies on 19 points

Abstract

We report the exact value of the number of labeled partially ordered sets (equivalently, labeled $T_0$ topologies) on 19 points, P(19) = 646099441937791106493755218560442089979, a 39-digit integer extending OEIS A001035, whose largest previously computed term was P(18) (Brinkmann and McKay). By the Stirling transform we also obtain the number of labeled topologies on 19 points, A000798(19) = 689054943207246404281592791142107048261. Our route is the Erné-Stege moment reduction, which expresses P(19) through a few sums of antichain counts over the posets on at most 16 points. All of these are available from the posets on at most 15 points (whose number is catalogued, and which standard software generates on demand), except a single moment over the 16-point posets. That moment is obtained not by enumerating the 16-point posets but by inserting a single element into the 15-point ones, with a per-parent kernel that advances the sum at the cost of computing the parent's own antichain count. The result passes several independent checks, among them the residue predicted by the modular periodicity of A001035 and the recovery from the same sweep of the known count P(16) and the Erné-Stege moments G(16,1) and G(16,2). We also report the moments G(16,3) and G(16,4), the latter an input to the analogous computation for 20 points.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rafael Ayala. 2026-06-30. The number of labeled partial orders and topologies on 19 points. https://arxiv.org/abs/2606.31526

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