A Machine Representation of Finite T 0 Topologies

DOI10.1145/322033.322045MaRDI QIDQ3047880zbMATH OpenOpenAlexFDO

Authors Shawpawn Kumar Das

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

zbMATH Keywords

computer manipulationfinite \(T_0\) topologieslabeled \(T_0\)-topologysimilarity classes of \(T_0\)-topologies

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to general topology (54-04) Lower separation axioms ((T_0)--(T_3), etc.) (54D10)

Cited in

(15)

• 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
• The number of nonisomorphic posets having 12 elements
• 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 the cardinality of the \(T_0\)-topologies on a finite set
• On recursion relations in the problem of enumeration of posets
• On recurrence relation in the problem of enumeration of finite posets
• On some formulas in the problem of enumeration of finite labeled topologies
• On enumeration of EL-hypergroups of order 3 obtained from ordered semigroups
• Some recurrence relations in finite topologies
• Dénombrement des ordres étagés
• Periodicity of residues of the number of finite labeled topologies

This page was built for publication: A Machine Representation of Finite T ₀ Topologies

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