A Machine Representation of Finite T 0 Topologies
From MaRDI portal
Publication:3047880
DOI10.1145/322033.322045zbMath0413.54022OpenAlexW2077120286MaRDI QIDQ3047880
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322033.322045
computer manipulationfinite \(T_0\) topologieslabeled \(T_0\)-topologysimilarity classes of \(T_0\)-topologies
Lower separation axioms ((T_0)--(T_3), etc.) (54D10) Software, source code, etc. for problems pertaining to general topology (54-04)
Related Items (14)
The Frattini sublattice of a finite distributive lattice ⋮ The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases) ⋮ On some formulas in the problem of enumeration of finite labeled topologies ⋮ On the cardinalities of finite topologies and the number of antichains in partially ordered sets ⋮ On the number of transitive digraphs with n labeled vertices and k arcs ⋮ New results from an algorithm for counting posets ⋮ Counting finite posets and topologies ⋮ On recurrence relation in the problem of enumeration of finite posets ⋮ On the cardinality of the \(T_0\)-topologies on a finite set ⋮ On recursion relations in the problem of enumeration of posets ⋮ Some recurrence relations in finite topologies ⋮ Dénombrement des ordres étagés ⋮ Periodicity of residues of the number of finite labeled topologies ⋮ The number of nonisomorphic posets having 12 elements
This page was built for publication: A Machine Representation of Finite T 0 Topologies
