On the computer enumeration of finite topologies
From MaRDI portal
Publication:5552182
DOI10.1145/363282.363311zbMath0166.01003OpenAlexW2003230391MaRDI QIDQ5552182
No author found.
Publication date: 1967
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/363282.363311
Related Items (38)
On DG-topological spaces associated with directed graphs ⋮ Mutually complementary partial orders ⋮ The number of labelled topologies on nine points ⋮ Partial order complementation graphs ⋮ The independent compatible edges topology of directed graphs ⋮ Finite fuzzy topological spaces ⋮ The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases) ⋮ Birational equivalence of reduced graphs ⋮ The number of weak orders. A comment ⋮ Properties of 2-CNF mutually dual and self-dual T_0 -topologies on a finite set and calculation of T_0-topologies of a certain weight ⋮ On some formulas in the problem of enumeration of finite labeled topologies ⋮ Homologies of transitive digraphs and discrete spaces;Гомологии транзитивных орграфов и дискретных пространств ⋮ Number of labeled topologies on ten points ⋮ 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 ⋮ Counting of finite topologies and a dissection of Stirling numbers of the second kind ⋮ The Number of Finite Topologies ⋮ On the enumeration of finite topologies ⋮ Self complementary topologies and preorders ⋮ New results from an algorithm for counting posets ⋮ Counting finite posets and topologies ⋮ Topologies on the \(n\)-element set consistent with topologies close to discrete on an \((n -1)\)-element set ⋮ On support sets of acyclic and transitive digraphs ⋮ On recurrence relation in the problem of enumeration of finite posets ⋮ Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool ⋮ On the cardinality of the \(T_0\)-topologies on a finite set ⋮ A note on some generalized closed sets in bitopological spaces associated to digraphs ⋮ Properties of distance spaces with power triangle inequalities ⋮ Unnamed Item ⋮ Computer programing for construction and enumeration of all regular topologies and equivalence relations on finite sets ⋮ Regular rings and distributive lattices ⋮ Asymptotic Enumeration of Partial Orders on a Finite Set ⋮ On recursion relations in the problem of enumeration of posets ⋮ Properties of topological spaces associated with sigraphs ⋮ Struktur- und Anzahlformeln für Topologien auf endlichen Mengen ⋮ Combinatorial properties of binary semigroups ⋮ Periodicity of residues of the number of finite labeled topologies ⋮ On the spectrum and number of convex sets in graphs
This page was built for publication: On the computer enumeration of finite topologies
