An algorithm of polynomial order for computing the covering dimension of a finite space

DOI10.1016/j.amc.2013.12.185zbMath1410.54038OpenAlexW2051009663MaRDI QIDQ1644532

Dimitris Georgiou, Athanasios Megaritis

Publication date: 21 June 2018

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

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

zbMATH Keywords

incidence matrixcovering dimensionfinite spacealgorithm of polynomial order

Mathematics Subject Classification ID

Dimension theory in general topology (54F45)

Related Items (8)

Small and large inductive dimension for ideal topological spaces ⋮ The dimension Dind of finite topological \(T_0\)-spaces ⋮ Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension ⋮ A study of the quasi covering dimension of Alexandroff countable spaces using matrices ⋮ Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces ⋮ A study of the order dimension of a poset using matrices ⋮ Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means ⋮ A study of a covering dimension of finite lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering dimension and finite spaces
• Duality and finite spaces
• Computer graphics and connected topologies on finite ordered sets
• Dimensional properties of graphs and digital spaces.
• Geometry of digital spaces
• On storage of topological information
• Computer programing for construction and enumeration of all regular topologies and equivalence relations on finite sets
• On zero dimensional space and its retraction
• Singular homology groups and homotopy groups of finite topological spaces
• Dimension of Dense Subalgebras of C(X)
• Digital Topology
• Finite Topological Spaces

This page was built for publication: An algorithm of polynomial order for computing the covering dimension of a finite space