Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces
There exists a well-known one-to-one correspondence between Alexandroff topologies on a set \(X\) and preorder relations on \(X\). Under this bijection, topologies satisfying the \(T_0\) separation axiom correspond to partial orders. In addition, a subset of an Alexandroff topological space is open if and only if it is a down-set of the corresponding preorder relation. Making use of this correspondence, the authors study in this article the small inductive dimension, the large inductive dimension and the covering dimension of Alexandroff spaces. First, they prove that the small inductive dimension (resp. large inductive dimension, covering dimension) of an Alexandroff space coincides with that of its Kolmogorov quotient. Then they study each of these notions in particular. It is known that the small inductive dimension of a finite \(T_0\)-space coincides with the height of its associated poset ([\textit{P. Wiederhold} and \textit{R. G. Wilson}, ``Dimension for Alexandrov spaces, in: Vision Geometry Proceedings of Society Photo-Optical Instrumentation Engineers 1832, 13--22 (1992); \textit{A. V. Evako} et al., J. Math. Imaging Vis. 6, No. 2--3, 109--119 (1996; Zbl 1191.05088); \textit{D. N. Georgiou} et al., Topology Appl. 168, 103--119 (2014; Zbl 1295.54032)]). Therefore, for any finite \(T_0\)-space \(X\) the small inductive dimension of \(X\) is at most \(\# X -1\). As a consequence of the previously mentioned results, the authors extend this upper bound to arbitrary finite topological spaces and prove that the the small inductive dimension of a finite space \(X\) is \(\# X -1\) if and only if its associated preordered set is a totally ordered poset. On the other hand, it is also known that the covering dimension of a finite space \(X\) with \(\# X\geq 2\) is at most \(\# X -2\) [\textit{D. N. Georgiou} and \textit{A. C. Megaritis}, Appl. Math. Comput. 218, No. 7, 3122--3130 (2011; Zbl 1244.65030)]. In the article under consideration, the authors prove that the covering dimension of a finite space \(X\) is one less than the maximum of the branch widths of the minimal elements of the Kolmogorov quotient of \(X\), where the branch width of an element \(a\) of a poset \(P\) is defined as the number of maximal elements of \(P\) that are comparable to \(a\). Using this result, they prove that the covering dimension of a finite space \(X\) with \(\# X> 2\) is \(\# X -2\) if and only if the associated preordered set is a poset which has a minimum element and \(\# X -1\) maximal elements. In addition, the authors prove that for any finite space \(X\), the sum of the covering dimension of \(X\) and the small inductive dimension of \(X\) is at most \(\# X -1\). Finally, the authors give a characterization of the large inductive dimension of a finite space \(X\) as the maximum of the heights of a certain type of subposets of the preordered set associated to \(X\). They also prove that the large inductive dimension of a finite space \(X\) is at most \(\lfloor\frac{\#X -1}{2}\rfloor\) and characterize the finite spaces \(X\) whose large inductive dimension is \(\lfloor\frac{\#X -1}{2}\rfloor\). Reviewer's remark: In the references, the name of the first author of reference [Zbl 1191.05088] contains a typo.
- Efficient computation of the large inductive dimension using order- and graph-theoretic means
- Dimensions of the type and Alexandroff spaces
- Small inductive dimension and Alexandroff topological spaces
- Finite spaces: a reduction algorithm for the computation of the small inductive dimension
- The dimension Dind of finite topological T₀-spaces
- A computing procedure for the small inductive dimension of a finite \(\mathrm{T}_0\)-space
- Algebraic topology of finite topological spaces and applications
- An algorithm of polynomial order for computing the covering dimension of a finite space
- Computer Algebra in Scientific Computing
- Counting finite posets and topologies
- Covering dimension and finite spaces
- Covering Dimension and Quasi-Order Spaces
- Depth-First Search and Linear Graph Algorithms
- Dimension and Finite Spaces
- Dimensional properties of graphs and digital spaces.
- Finite spaces: a reduction algorithm for the computation of the small inductive dimension
- Finite Topological Spaces
- scientific article; zbMATH DE number 3479763 (Why is no real title available?)
- scientific article; zbMATH DE number 1332362 (Why is no real title available?)
- scientific article; zbMATH DE number 1953899 (Why is no real title available?)
- scientific article; zbMATH DE number 3003215 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3234211 (Why is no real title available?)
- scientific article; zbMATH DE number 3028682 (Why is no real title available?)
- Partially Ordered Sets
- Small inductive dimension and Alexandroff topological spaces
- Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool
- Topological dimension and dynamical systems. Translated from the French by the author
- The Alexandroff dimension of digital quotients of Euclidean spaces
- Universality property and dimension for frames
- Submodular functions and rooted trees
- The dimension Dind of finite topological T₀-spaces
- A computing procedure for the small inductive dimension of a finite \(\mathrm{T}_0\)-space
- 2-dimension from the topological viewpoint
- Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension
- On finite \(T_0\) topological spaces
- Dimension and continuity on T₀-Alexandroff spaces
- Dimensions of the type and Alexandroff spaces
- scientific article; zbMATH DE number 1107518 (Why is no real title available?)
- Finite, primitive and euclidean spaces
- Efficient computation of the large inductive dimension using order- and graph-theoretic means
- Finite spaces: a reduction algorithm for the computation of the small inductive dimension
- The small inductive dimension of subsets of Alexandroff spaces
- Quasihomeomorphisms and Skula spaces
- On a quotient \(S\)-set induced by countably infinite decreasing chains
- Covering dimension of finite topological spaces
- A study of the small inductive dimension in the area of finite lattices
- Quasi covering dimension of topological spaces
- Zero-dimensional extensions of topologies
- Covering dimension of finite distributive lattices
- Closed graph property and Khalimsky spaces
- A study of dimension dind for finite T₀-spaces through matrices
- Finite lattices and large inductive dimension
This page was built for publication: Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274045)
