Swing lattice game and a direct proof of the swing lemma for planar semimodular lattices
From MaRDI portal
Publication:3133255
DOI10.14232/ACTASM-016-036-3zbMATH Open1399.06019arXiv1607.06809OpenAlexW2962680177WikidataQ124801158 ScholiaQ124801158MaRDI QIDQ3133255FDOQ3133255
Publication date: 13 February 2018
Published in: Acta Scientiarum Mathematicarum (Search for Journal in Brave)
Abstract: The swing lemma, due to G. Gr"atzer for slim semimodular lattices and extended by G. Cz'edli and G. Gr"atzer for all planar semimodular lattices, describes the congruence generated by a prime interval in an efficient way. Here we present a new proof for this lemma, which is shorter than the earlier two. Also, motivated by the swing lemma and mechanical pinball games with flippers, we construct an online game called Swing lattice game. A computer program realizing this game is available from the authors' websites.
Full work available at URL: https://arxiv.org/abs/1607.06809
Recommendations
- Congruence structure of planar semimodular lattices: the general swing lemma
- Congruences in slim, planar, semimodular lattices: the swing lemma
- Congruences and prime-perspectivities in finite lattices.
- Lamps in slim rectangular planar semimodular lattices
- Diagrams and rectangular extensions of planar semimodular lattices
Cited In (5)
- Slim patch lattices as absolute retracts and maximal lattices
- Absolute retracts for finite distributive lattices and slim semimodular lattices
- Congruence structure of planar semimodular lattices: the general swing lemma
- A new property of congruence lattices of slim, planar, semimodular lattices
- A convex combinatorial property of compact sets in the plane and its roots in lattice theory
This page was built for publication: Swing lattice game and a direct proof of the swing lemma for planar semimodular lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133255)
