Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension

DOI10.1016/J.AMC.2020.125523MaRDI QIDQ2660352zbMATH OpenOpenAlexFDO

Authors Rudolf Berghammer, Michael Winter, Steffen Börm

Publication date 30 March 2021

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

Full work available at URL https://arxiv.org/abs/2003.12871

zbMATH Keywords

backtracking algorithmcovering dimensionfinite topological spaceGMPOpenMPparallelisationpartial orderset partitionspecialisation pre-order

Mathematics Subject Classification ID

Compact (locally compact) metric spaces (54E45) Dimension theory in general topology (54F45)

Recommendations

• An algorithm of polynomial order for computing the covering dimension of a finite space
• A computing procedure for the small inductive dimension of a finite \(\mathrm{T}_0\)-space
• Relative dimension r-dim and finite spaces
• Finite spaces: a reduction algorithm for the computation of the small inductive dimension
• Efficient computation of the large inductive dimension using order- and graph-theoretic means

Cites work

• A computing procedure for the small inductive dimension of a finite \(\mathrm{T}_0\)-space
• A Fast Algorithm for Generating Set Partitions
• An algorithm of polynomial order for computing the covering dimension of a finite space
• Counting finite posets and topologies
• Covering dimension and finite spaces
• Dimensional properties of graphs and digital spaces.
• Finite spaces: a reduction algorithm for the computation of the small inductive dimension
• scientific article; zbMATH DE number 3860390 (Why is no real title available?)
• scientific article; zbMATH DE number 3479763 (Why is no real title available?)
• scientific article; zbMATH DE number 3622573 (Why is no real title available?)
• scientific article; zbMATH DE number 3028682 (Why is no real title available?)
• Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces
• Small inductive dimension and Alexandroff topological spaces
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

Cited in

(5)

• An algorithm of polynomial order for computing the covering dimension of a finite space
• Isolated sublattices and their application to counting closure operators
• Isolated suborders and their application to counting closure operators
• Zero-dimensional extensions of topologies
• A study of dimension dind for finite T₀-spaces through matrices

This page was built for publication: Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2660352)