Facebook Instagram Twitter RSS Feed PodBean Back to top on side

On the number of slim, semimodular lattices

In: Mathematica Slovaca, vol. 66, no. 1
Gábor Czédli - Tamás Dékány - László Ozsvárt - Nóra Szakács - Balázs Udvari
Detaily:
Rok, strany: 2016, 5 - 18
Kľúčové slová:
composition series, Jordan-Hölder theorem, counting lattices,number of inversions, number of permutations, slim lattice, planar lattice, semimodular lattice
O článku:
A lattice $L$ is slim if it is finite and the set of its join-irreducible elements contains no three-element antichain. Slim, semimodular lattices were previously characterized by G. Czédli and E. T. Schmidt as the duals of the lattices consisting of the intersections of the members of two composition series in a group. Our main result determines the number of (isomorphism classes of) these lattices of a given size in a recursive way. The corresponding planar Hasse diagrams, up to similarity, are also enumerated. We prove that the number of diagrams of slim, distributive lattices of a given length $n$ is the $n$th Catalan number. Besides lattice theory, the paper includes some combinatorial arguments on permutations and their inversions.
Ako citovať:
ISO 690:
Czédli, G., Dékány, T., Ozsvárt, L., Szakács, N., Udvari, B. 2016. On the number of slim, semimodular lattices. In Mathematica Slovaca, vol. 66, no.1, pp. 5-18. 0139-9918. DOI: https://doi.org/10.1515/ms-2015-0111

APA:
Czédli, G., Dékány, T., Ozsvárt, L., Szakács, N., Udvari, B. (2016). On the number of slim, semimodular lattices. Mathematica Slovaca, 66(1), 5-18. 0139-9918. DOI: https://doi.org/10.1515/ms-2015-0111
O vydaní:
Publikované: 1. 2. 2016