Congruences of Multinomial Lattices

Details Congruences of Multinomial Lattices Congruences of Multinomial Lattices

2005-10-05

arxiv.org/abs/math/0510098v1

Mathematics

Combinatorics

Scientific paper

We study the congruence lattices of the multinomial lattices L(v) introduced by Bennett and Birkhoff. Our main motivation is to investigate Parikh equivalence relations that model concurrent computation. We accomplish this goal by providing an explicit description of the join dependency relation between two join irreducible elements and of its reflexive transitive closure. The explicit description emphasizes several properties and makes it possible to separate the equational theories of multinomial lattices by their dimensions. In their covering of non modular varieties Jipsen and Rose define a sequence of equations SD_{n}(\land), for n \geq 0. Our main result sounds as follows: if v = (v_{1},...,v_{n}) \in N^{n} and v_{i} > 0 for i = 1,..., n, then the multinomial lattice L(v) satisfies SD_{n-1}(\land) and fails SD_{n-2}(\land).

Affiliated with

Also associated with

No associations

Rating

Congruences of Multinomial Lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Congruences of Multinomial Lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Congruences of Multinomial Lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-250348