Computer programing for construction and enumeration of all regular topologies and equivalence relations on finite sets

DOI10.1016/j.amc.2004.04.045zbMath1069.54002OpenAlexW2038006719MaRDI QIDQ1780493

S. E. Abbas, A. S. Farrag

Publication date: 13 June 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.04.045

zbMATH Keywords

algorithmregular principal topologyweaker topologies

Mathematics Subject Classification ID

Several topologies on one set (change of topology, comparison of topologies, lattices of topologies) (54A10) Fairly general properties of topological spaces (54D99)

Related Items (2)

An algorithm of polynomial order for computing the covering dimension of a finite space ⋮ Covering dimension and finite spaces

Cites Work

• Unnamed Item
• The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases)
• Das Halbordnungssystem der topologischen Räume auf einer Menge
• Computer construction and enumeration of all topologies and all hyperconnected topologies on finite sets
• Computer construction and enumeration of topologies on finite sets
• On the Number of Topologies on A Finite Set
• The Lattice of Topologies: Structure and Complementation
• On the computer enumeration of finite topologies
• Topology on Finite Sets

This page was built for publication: Computer programing for construction and enumeration of all regular topologies and equivalence relations on finite sets