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

摘要

This paper characterizes the regular principal topology on a nonempty set X. This result gives us a correspondence between the families of all regular principal toplogies on X and all equivalence relations on X. The strictly weaker regular principal topologies on a set X than a given regular principal topology on X are characterized. If X-n is a finite set of n points this paper mainly describes an algorithm to construct and enumerate all weaker regular and all strictly weaker regular principal topologies on X-n than a given regular topology on X-n. All regular topologies on X-n are constructed and enumerated. (c) 2004 Elsevier Inc. All rights reserved.