On the join dependency relation in multinomial lattices (Q2464733)

The paper deals with multinomial lattices. Multinomial lattices were introduced by \textit{M. K. Bennett} and \textit{G. Birkhoff} [Algebra Univers. 32, No. 1, 115--144 (1994; Zbl 0810.06006)]. A multinomial lattice \(\mathcal{L}(v)\) has as underlying set the collection of all ``discrete'' paths from \(0\) to \(v\), where \(v=(v_1,\dots v_n)\) is a vector in \({\mathbb{N}}^n\) and \(n\) can be an arbitrary positive integer (\(\mathbb{N}\) is the set of all natural numbers). The paths are discrete in that at each time unit just one coordinate is increased by \(1\). These paths are in bijection with words \(w\) over an alphabet \(\Sigma= \{ a_1, \dots , a_n\}\) such that the number of letters \(a_i\) occurring in \(w\) is equal to \(v_i\). The main goal of the paper is to give an explicit characterization of congruence lattices of multinomial lattices. The author has accomplished this goal by studying and characterizing the dependency relation between join irreducible elements and their reflexive transitive closure.