login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A319615
Maximum orbit size of rowmotion on the symmetric group.
0
1, 2, 4, 12, 20, 128, 412, 2184
OFFSET
1,2
COMMENTS
Rowmotion on a semidistributive lattice is obtained by sending an element with a specified join-canonical decomposition to the unique element with the same meet-canonical decomposition (under the bijection between join- and meet-irreducible elements). a(n) is the maximum orbit size of rowmotion on the symmetric group.
LINKS
Emily Barnard, The canonical join complex, arXiv preprint arXiv:1610.05137 [math.CO], 2016.
Hugh Thomas and Nathan Williams, Rowmotion in slow motion, arXiv preprint arXiv:1712.10123 [math.CO], 2017-2018. See 7.11 p. 26.
Hugh Thomas and Nathan Williams, Independence Posets, arXiv preprint arXiv:1805.00815 [math.CO], 2018.
EXAMPLE
a(3)=4 because of the orbit [213, 312, 132, 231].
a(4)=12 because of the orbit [1342, 3241, 2314, 4213, 1243, 3421, 3124, 4132, 1423, 2431, 2134, 4312].
PROG
(Sage)
from sage.combinat.cyclic_sieving_phenomenon import orbit_decomposition
def AA(n):
L=WeylGroup(['A', n]).weak_lattice()
lower=dict([(l, Set(L.canonical_joinands(l))) for l in L])
J, M=L.join_irreducibles(), L.meet_irreducibles()
meet_to_join=dict([(m, L.meet([l for l in J if L.le(l, L.upper_covers(m)[0]) and not(L.le(l, m))])) for m in M])
upper=dict([(Set([meet_to_join[i] for i in L.canonical_meetands(l)]), l) for l in L])
return max(map(len, orbit_decomposition(L, lambda w: upper[lower[w]] )))
CROSSREFS
Sequence in context: A121569 A319213 A099603 * A375742 A343865 A376006
KEYWORD
nonn,hard,more
AUTHOR
Nathan Williams, Sep 24 2018
EXTENSIONS
a(7) from Lucas A. Brown, May 29 2023
STATUS
approved