The small inductive dimension of finite lattices through matrices

Dimensions of partially ordered sets, lattices and frames have attracted the interest of various researches (see for example Sancho de Salas and Sancho de Salas 1991; Vinokurov 1966; Dushnik and Miller 1941; Hegde and Jain 2007; Trotter 1975; Boyadzhiev et al. 2018; Dube et al. 2015, 2017; Georgiou et al. 2016; Hai-feng et al. 2017; Brijlall and Baboolal 2008, 2010; Boyadzhiev et al. 2019). For example, the order, Krull, covering dimension, and the quasi covering dimension are some of these dimensions that have been studied extensively. Especially, finite partially ordered sets and finite lattices are the main axes of this Dimension Theory, investigating new results and characterizations for their dimensions. The matrix algebra plays an essential role in these studies, considering incidence and order matrices. Also, based on these researches, algorithms which compute these dimensions have been investigated. Since the chapter on dimensions of partially ordered sets continues to attract the interest, the small inductive dimension is a new notion that has been defined firstly for regular frames in Brijlall and Baboolal (2008). In this paper, we study the small inductive dimension for finite lattices using matrices. For that, we study the meaning of the pseudocomplement and the lattice ?x, where x is an element of a finite lattice. Based on these investigations we present an algorithmic procedure for the matrix computation of the small inductive dimension of an arbitrary finite lattice.

Automated summary

The dimensions of partially ordered sets, lattices, and frames have been a subject of interest for researchers. Matrix algebra plays an important role in studying these dimensions. In this paper, we investigate the small inductive dimension for finite lattices using matrices and propose an algorithmic procedure for computing it.