Notes on the description of join-distributive lattices by permutations

dc.contributor.author	Adaricheva, Kira
dc.contributor.author	Cz´edli, G´abor
dc.contributor.institution	School of Sciences and Humanities
dc.date.accessioned	2016-02-09T09:29:33Z
dc.date.available	2016-02-09T09:29:33Z
dc.date.issued	2012
dc.description.abstract	Let L be a join-distributive lattice with length n and width (Ji L) k. There are two ways to describe L by k − 1 permutations acting on an n-element set: a combinatorial way given by P.H. Edelman and R. E. Jamison in 1985 and a recent lattice theoretical way of the second author. We prove that these two approaches are equivalent. Also, we characterize join-distributive lattices by trajectories
dc.identifier.citation	Adaricheva, K., & Czédli, G. (2014). Note on the description of join-distributive lattices by permutations. Algebra universalis, 72(2), 155-162.
dc.identifier.uri	http://nur.nu.edu.kz/handle/123456789/1213
dc.language.iso	en
dc.rights	Attribution-NonCommercial-ShareAlike 3.0 United States
dc.source	Algebra universalis, 72(2), pages 155-162.
dc.subject	mathematics
dc.subject	join-distributive lattices
dc.title	Notes on the description of join-distributive lattices by permutations
dc.type	Article

Files

Now showing 1 - 1 of 1