Pages that link to "Item:Q3047880"
From MaRDI portal
The following pages link to A Machine Representation of Finite <i>T</i> <sub>0</sub> Topologies (Q3047880):
Displaying 14 items.
- On recurrence relation in the problem of enumeration of finite posets (Q515207) (← links)
- Some recurrence relations in finite topologies (Q762157) (← links)
- Dénombrement des ordres étagés (Q762485) (← links)
- Periodicity of residues of the number of finite labeled topologies (Q789388) (← links)
- On the cardinalities of finite topologies and the number of antichains in partially ordered sets (Q1154468) (← links)
- On the number of transitive digraphs with n labeled vertices and k arcs (Q1155069) (← links)
- New results from an algorithm for counting posets (Q1177709) (← links)
- Counting finite posets and topologies (Q1183945) (← links)
- The number of nonisomorphic posets having 12 elements (Q1314405) (← links)
- The Frattini sublattice of a finite distributive lattice (Q1338948) (← links)
- The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases) (Q1918536) (← links)
- On the cardinality of the \(T_0\)-topologies on a finite set (Q2248732) (← links)
- On recursion relations in the problem of enumeration of posets (Q2306042) (← links)
- On some formulas in the problem of enumeration of finite labeled topologies (Q6174158) (← links)
