IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v389y2021ics0096300320304811.html
   My bibliography  Save this article

Algorithmic Counting of Zero-Dimensional Finite Topological Spaces With Respect to the Covering Dimension

Author

Listed:
  • Berghammer, Rudolf
  • Börm, Steffen
  • Winter, Michael

Abstract

Taking the covering dimension dim as notion for the dimension of a topological space, we first specify the number zdimT0(n) of zero-dimensional T0-spaces on {1,…,n} and the number zdim(n) of zero-dimensional arbitrary topological spaces on {1,…,n} by means of two mappings po and P that yield the number po(n) of partial orders on {1,…,n} and the set P(n) of partitions of {1,…,n}, respectively. Algorithms for both mappings exist. Assuming one for po to be at hand, we use our specification of zdimT0(n) and modify one for P in such a way that it computes zdimT0(n) instead of P(n). The specification of zdim(n) then allows to compute this number from zdimT0(1) to zdimT0(n) and the Stirling numbers of the second kind S(n, 1) to S(n, n). The resulting algorithms have been implemented in C and we also present results of practical experiments with them. To considerably reduce the running times for computing zdimT0(n), we also describe a backtracking approach and its parallel implementation in C using the OpenMP library.

Suggested Citation

  • Berghammer, Rudolf & Börm, Steffen & Winter, Michael, 2021. "Algorithmic Counting of Zero-Dimensional Finite Topological Spaces With Respect to the Covering Dimension," Applied Mathematics and Computation, Elsevier, vol. 389(C).
    • Handle: RePEc:eee:apmaco:v:389:y:2021:i:c:s0096300320304811
    DOI: 10.1016/j.amc.2020.125523
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320304811
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125523?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:389:y:2021:i:c:s0096300320304811. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.