No label defined (Q4222633)

This paper is strongly connected with another paper of the author [Papers in honor of Giovanni Melzi, Milano, Univ. Cattolica del Sacro Cuore, Sci. Mat. 11, 367-390 (1994; Zbl 0816.20068)] Let \(G\) be a hypergroup and let \(\mathcal T\) be the family of all subsemihypergroups of \(G\). If \(\bigcap_{T\in{\mathcal T}} T\neq\emptyset\) then \({\mathcal S}={\mathcal T}\) is a closure system and if \(\bigcap_{T\in{\mathcal T}}T=\emptyset\) then \({\mathcal S}={\mathcal T}\cup\{\emptyset\}\) is a closure system for \(G\). Using these closure systems, the author introduces some very interesting types of dimensions for \(G\). A chain of length \(n\) on \(G\) is a sequence \((S_1,\dots,S_n)\) of elements of \(\mathcal S\) such that \(S_i\subsetneqq S_{i+1}\), for every \(i\in\{1,\dots,n-1\}\). A chain with the property that for every \(i\in\{1,\dots,n-1\}\) there is no \(S\in{\mathcal S}\) such that \(S_i\subsetneqq S\subsetneqq S_{i+1}\) is said to be maximal (or saturated). Assume that the length of all chains of \(G\) is upper bounded. Then the minimal (resp. maximal) geometrical dimension of \(G\) is the integer \(d_m=d_m(G)\) (resp. \(d_M=d_M(G)\)) with the property that \(d_m+1\) (resp. \(d_M+1\)) is the minimal (resp. maximal) length of all saturated chains of \(G\). Using once again the previous closure system \(\mathcal S\) one can define the minimal linear dimension \(\delta_m=\delta_m(G)\) and the maximal linear dimension \(\delta_M=\delta_M(G)\) of \(G\). Then properties of these types of dimensions, particularly connections between them and the heart of \(G\), are studied. Geometric meaning of the relation \(\beta^*\) is presented. Finally, characterizations of hypergroups for which these four dimensions coincide are studied.