A study of the order dimension of a poset using matrices
From MaRDI portal
Publication:5236031
DOI10.2989/16073606.2016.1161670zbMath1436.06007OpenAlexW2495945190MaRDI QIDQ5236031
F. Sereti, Dimitris Georgiou, Athanasios Megaritis
Publication date: 15 October 2019
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073606.2016.1161670
Related Items (3)
The small inductive dimension of finite lattices through matrices ⋮ A study of the quasi covering dimension of finite lattices ⋮ A study of a covering dimension of finite lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering dimension and finite spaces
- An algorithm of polynomial order for computing the covering dimension of a finite space
- Ordered sets
- A study of covering dimension for the class of finite lattices.
- A computing procedure for the small inductive dimension of a finite \(\mathrm{T}_0\)-space
- The Hardness of Approximating Poset Dimension
- Inequalities in Dimension Theory for Posets
- A Poset Dimension Algorithm
- Homeomorphisms on Finite Sets
- Partially Ordered Sets
This page was built for publication: A study of the order dimension of a poset using matrices