Obtainable Sizes of Topologies on Finite Sets

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a topology with a prescribed size, we show that this number has a logarithmic upper bound. We deduce that there exists a topology on n points having k open sets, for all k in an interval which is exponentially large in n. The construction algorithms can be modified to produce topologies where the smallest neighborhood of each point has a minimal size, and we give a range of obtainable sizes for such topologies.
Final version, to appear in Journal of Combinatorial Theory, Series A

Keywords

Combinatorics, General Topology, 06A07 (Primary); 54A99, 05A99 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/230722

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0802.2550
 http://arxiv.org/abs/0802.2550

Collections

arXiv