Posets on up to 16 points

DOI10.1023/A:1016543307592zbMath1006.06003OpenAlexW2298449139MaRDI QIDQ698446

Gunnar Brinkmann, Brendan D. McKay

Publication date: 18 September 2002

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

algorithmenumerationtopologiescanonical construction pathlabelled posetsnumbers of non-isomorphic posets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Lower separation axioms ((T_0)--(T_3), etc.) (54D10) Algebraic aspects of posets (06A11) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Related Items (34)

Dimensional reduction in causal set gravity ⋮ A frequentist view on cycle-transitivity of reciprocal relations ⋮ Uniform random posets ⋮ Classification of categories with matrices of coefficient 2 and ordern ⋮ Posets with interfaces as a model for concurrency ⋮ On symmetric closed subsets of real affine root systems ⋮ Untangling comparison bias in inductive item tree analysis based on representative random quasi-orders ⋮ On some formulas in the problem of enumeration of finite labeled topologies ⋮ Closed subsets of root systems and regular subalgebras ⋮ Minor posets of functions as quotients of partition lattices ⋮ On support sets of acyclic and transitive digraphs ⋮ Poset splitting and minimality of finite models ⋮ Aggregation on Boolean multi-polar space: knowledge-based vs. category-based ordering ⋮ On recurrence relation in the problem of enumeration of finite posets ⋮ On the cardinality of the \(T_0\)-topologies on a finite set ⋮ Posets Dismantlable by Doubly Irreducibles ⋮ Exact counting of unlabeled rigid interval posets regarding or disregarding height ⋮ Reconstruction of small graphs and digraphs ⋮ Obtainable sizes of topologies on finite sets ⋮ Counting linear extension majority cycles in partially ordered sets on up to 13 elements ⋮ Realizable monotonicity for continuous-time Markov processes ⋮ Generating modular lattices of up to 30 elements ⋮ Unnamed Item ⋮ The complete k-arcs of PG(2, 27) and PG(2, 29) ⋮ On recursion relations in the problem of enumeration of posets ⋮ Onset of the Asymptotic Regime for (Uniformly Random) Finite Orders ⋮ A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets ⋮ Unnamed Item ⋮ Classification of Graph C ∗-Algebras with No More than Four Primitive Ideals ⋮ Counterexamples to the poset conjectures of Neggers, Stanley, and Stembridge ⋮ A Coxeter type classification of one-peak principal posets ⋮ A generalization of a theorem of Erné about the number of posets with a fixed antichain ⋮ Ordered semigroups of size at most 7 and linearly ordered semigroups of size at most 10. ⋮ Unnamed Item

Uses Software

• nauty

This page was built for publication: Posets on up to 16 points