Notes on the description of join-distributive lattices by permutations
| dc.contributor.author | Adaricheva, Kira | |
| dc.contributor.author | Cz´edli, G´abor | |
| 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 | ru_RU |
| dc.identifier.citation | Kira Adaricheva, G´abor Cz´edli; 2012; Notes on the description of join-distributive lattices by permutations; arXiv.org | ru_RU |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/1213 | |
| dc.language.iso | en | ru_RU |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | Research Subject Categories::MATHEMATICS | ru_RU |
| dc.subject | join-distributive lattices | ru_RU |
| dc.title | Notes on the description of join-distributive lattices by permutations | ru_RU |
| dc.type | Article | ru_RU |