pith. sign in

arxiv: 1712.10123 · v2 · pith:MPNN5FTRnew · submitted 2017-12-29 · 🧮 math.CO

Rowmotion in slow motion

classification 🧮 math.CO
keywords latticeorderrowmotiontrimcomplexideallatticesmotion
0
0 comments X
read the original abstract

Rowmotion is a simple cyclic action on the distributive lattice of order ideals of a poset: it sends the order ideal x to the order ideal generated by the minimal elements not in x. It can also be computed in "slow motion" as a sequence of local moves. We use the setting of trim lattices to generalize both definitions of rowmotion, proving many structural results along the way. We introduce a flag simplicial complex (similar to the canonical join complex of a semidistributive lattice), and relate our results to recent work of Barnard by proving that extremal semidistributive lattices are trim. As a corollary, we prove that if A is a representation finite algebra and mod A has no cycles, then the torsion classes of A ordered by inclusion form a trim lattice.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The fundamental theorem of finite semidistributive lattices

    math.CO 2019-07 conditional novelty 8.0

    Finite semidistributive lattices are precisely the lattices of admissible subsets of a set with a torsion-pair abstraction, and this representation is unique.