The number of unlabeled orders on fourteen elements

DOI10.1023/A:1006431609027zbMath0987.05010OpenAlexW1514752746MaRDI QIDQ5935836

Jürgen Reinhold, Jobst Heitzig

Publication date: 2000

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1006431609027

zbMATH Keywords

enumerationtopologyfinite posetparallelizationorderly algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Topological spaces and generalizations (closure spaces, etc.) (54A05)

Related Items (12)

An enumeration of distinct and non-isomorphic functional quasi-order relations ⋮ The fixed point property for ordered sets ⋮ Height counting of unlabeled interval and \(N\)-free posets. ⋮ INDEPENDENT SETS FROM AN ALGEBRAIC PERSPECTIVE ⋮ Exact counting of unlabeled rigid interval posets regarding or disregarding height ⋮ The automorphism conjecture for small sets and series parallel sets ⋮ Residuated lattices of size \(\leq 12\) ⋮ Algebras defined from ordered sets and the varieties they generate ⋮ Unnamed Item ⋮ A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets ⋮ GENERALIZED TOPOLOGIES ON FINITE SETS ⋮ A generalization of a theorem of Erné about the number of posets with a fixed antichain

This page was built for publication: The number of unlabeled orders on fourteen elements