The following pages link to Posets on up to 16 points (Q698446):
Displaying 39 items.
- On recurrence relation in the problem of enumeration of finite posets (Q515207) (← links)
- Untangling comparison bias in inductive item tree analysis based on representative random quasi-orders (Q898753) (← links)
- Obtainable sizes of topologies on finite sets (Q966058) (← links)
- Counting linear extension majority cycles in partially ordered sets on up to 13 elements (Q980203) (← links)
- Realizable monotonicity for continuous-time Markov processes (Q981007) (← links)
- Counting finite posets and topologies (Q1183945) (← links)
- The number of orders with thirteen elements (Q1207714) (← links)
- The number of nonisomorphic posets having 12 elements (Q1314405) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Minor posets of functions as quotients of partition lattices (Q1732800) (← links)
- Poset splitting and minimality of finite models (Q1747765) (← links)
- Aggregation on Boolean multi-polar space: knowledge-based vs. category-based ordering (Q1749601) (← links)
- Exact counting of unlabeled rigid interval posets regarding or disregarding height (Q1757863) (← links)
- A generalization of a theorem of Erné about the number of posets with a fixed antichain (Q2088069) (← links)
- Closed subsets of root systems and regular subalgebras (Q2204850) (← links)
- On the cardinality of the \(T_0\)-topologies on a finite set (Q2248732) (← links)
- Generating modular lattices of up to 30 elements (Q2279675) (← links)
- On recursion relations in the problem of enumeration of posets (Q2306042) (← links)
- A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets (Q2314416) (← links)
- A Coxeter type classification of one-peak principal posets (Q2332382) (← links)
- Ordered semigroups of size at most 7 and linearly ordered semigroups of size at most 10. (Q2340379) (← links)
- A frequentist view on cycle-transitivity of reciprocal relations (Q2397881) (← links)
- Uniform random posets (Q2660856) (← links)
- Posets with interfaces as a model for concurrency (Q2672275) (← links)
- The complete k-arcs of PG(2, 27) and PG(2, 29) (Q3084612) (← links)
- Counterexamples to the poset conjectures of Neggers, Stanley, and Stembridge (Q3420264) (← links)
- Dimensional reduction in causal set gravity (Q3466364) (← links)
- Classification of categories with matrices of coefficient 2 and order<i>n</i> (Q4576679) (← links)
- On support sets of acyclic and transitive digraphs (Q4639850) (← links)
- Onset of the Asymptotic Regime for (Uniformly Random) Finite Orders (Q4976179) (← links)
- Reconstruction of small graphs and digraphs (Q5090542) (← links)
- (Q5094086) (← links)
- (Q5139691) (← links)
- Posets Dismantlable by Doubly Irreducibles (Q5164536) (← links)
- (Q5176418) (← links)
- Classification of Graph C ∗-Algebras with No More than Four Primitive Ideals (Q5244493) (← links)
- On symmetric closed subsets of real affine root systems (Q6038504) (← links)
- On some formulas in the problem of enumeration of finite labeled topologies (Q6174158) (← links)
- The Einstein-Hilbert action for entropically dominant causal sets (Q6571046) (← links)
