Posets on up to 16 points

DOI10.1023/A:1016543307592MaRDI QIDQ698446zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Counting finite posets and topologies
• The number of nonisomorphic posets having 12 elements
• The number of unlabeled orders on fourteen elements
• On numerical counting of prime, UPO, and the general type of posets according to heights
• New results from an algorithm for counting posets

Cited in

(38)

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

Describes a project that uses

Uses Software

• nauty

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698446)