A330040 Number of non-isomorphic cover graphs of lattice quotients of essential lattice congruences of the weak order on the symmetric group S_n.

1, 1, 3, 19, 748, 2027309

Offset

1,3

Links

Table of n, a(n) for n=1..6.

Hung Phuc Hoang, Torsten Mütze, Combinatorial generation via permutation languages. II. Lattice congruences, arXiv:1911.12078 [math.CO], 2019.

V. Pilaud and F. Santos, Quotientopes, arXiv:1711.05353 [math.CO], 2017-2019; Bull. Lond. Math. Soc., 51 (2019), no. 3, 406-420.

Example

For n=3, the weak order on S_3 has the cover relations 123<132, 123<213, 132<312, 213<231, 312<321, 231<321, and there are four essential lattice congruences, namely {}, {132=312}, {213=231}, {132=312,213=231}. The cover graph of the first one is a 6-cycle, the cover graph of the middle two is a 5-cycle, and the cover graph of the last one is a 4-cycle. These are 3 non-isomorphic graphs, showing that a(3)=3.

Crossrefs

Cf. A091687, A001246, A052528, A024786, A123663, A330039, A330042.

Sequence in context: A355615 A329470 A107706 * A168591 A319190 A350121

Adjacent sequences: A330037 A330038 A330039 * A330041 A330042 A330043

Keyword

nonn,hard

Author

Torsten Muetze, Nov 28 2019

Status

approved