Reproduce “The number of labeled partial orders and topologies on 19 points” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Rafael Ayala

Rafael Ayala computed the exact number of labeled partial orders on 19 points, P(19), and labeled topologies on 19 points, T(19), extending previous enumerations from 18 points. This was achieved by refining the Ern´e–Stege moment reduction with a novel single-pass moment-transfer kernel, providing precise values despite the super-exponential growth of these combinatorial sequences.

Key insights

  • The 'single-pass moment-transfer kernel' significantly enhances the efficiency of moment calculation, making it feasible to enumerate complex combinatorial objects without explicitly generating all instances.
  • Combining orderly generation, modular arithmetic, Chinese Remainder Theorem, and parallel processing provides a robust and verifiable framework for exact computations of sequences with super-exponential growth.
  • The Alexandrov correspondence establishes a direct combinatorial equivalence between labeled partial orders and T0 topologies, allowing for their enumeration to be linked through the Stirling transform.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.