Lattice bijections for string modules, snake graphs and the weak Bruhat order (Q2020038)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lattice bijections for string modules, snake graphs and the weak Bruhat order |
scientific article |
Statements
Lattice bijections for string modules, snake graphs and the weak Bruhat order (English)
0 references
23 April 2021
0 references
In this paper, the notion of abstract string module is introduced. Bijections between canonical submodule lattices of a string module, lattices given by an interval in the weak Bruhat order determined by the Coxeter element in a symmetric group associated to this string module, and perfect matching lattices of the corresponding snake graphs are provided. Some results on crossing snake graphs and their resolutions appearing in [\textit{İçakçı} and \textit{R. Schiffler}, J. Algebra 382, 240--281 (2013; Zbl 1319.13012)] are reviewed. In particular, a bijection between the perfect matching lattices of a pair of crossing snake graphs and the perfect matching lattices of their resolutions is presented in a simplified form.
0 references
string combinatorics
0 references
snake graphs
0 references
perfect matchings
0 references
symmetric groups
0 references
Bruhat order
0 references
distributive lattices
0 references
0 references