Rowmotion in slow motion
Hugh Thomas,Nathan Williams +1 more
44
TL;DR: In this article, it was shown 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.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Noncrossing Arc Diagrams, Tamari Lattices, and Parabolic Quotients of the Symmetric Group
TL;DR: In this article, a structural investigation of these parabolic Tamari lattices is performed, and modified arc diagrams are used to aid the understanding of these lattices, which are better known as noncrossing partitions.
Birational rowmotion and coxeter-motion on minuscule posets
TL;DR: As a generalization of birational promotion on a product of two chains, birational Coxeter-motion is introduced, and it is proved that it enjoys periodicity and file homomesy.
The steep-bounce zeta map in parabolic Cataland
TL;DR: In this article, the Steep-Bounce Conjecture was shown to be equivalent to the zeta map in q, t -Catalan combinatorics, and a new combinatorial object called the left-aligned colorable tree (LCT) was introduced.
•Posted Content
The fundamental theorem of finite semidistributive lattices
TL;DR: The fundamental theorem of finite semidistributive lattices (FTFSDL) of as mentioned in this paper is of the form "a poset L is a finite semi-distribution lattice if and only if there exists a set Sha with some additional structure, such that L is isomorphic to the admissible subsets of Sha ordered by inclusion; in this case, Sha and its additional structure are uniquely determined by L" The additional structure on Sha is a combinatorial abstraction of the notion of torsion pairs from representation theory and has geometric meaning in the case
12
The CDE property for skew vexillary permutations
TL;DR: The conjecture of Reiner, Tenner, and Yong which the initial weak order intervals corresponding to certain vexillary permutations have the coincidental down-degree expectations (CDE) property was proved in this paper.
11
References
•Book
Introduction to lattices and order
Brian A. Davey,Hilary A. Priestley +1 more
- 01 Jan 1990
TL;DR: The Stone Representation Theorem for Boolean algebras and its application to lattices in algebra can be found in this article, where the structure of finite distributive lattices and finite Boolean algebraic structures are discussed.
5.4K
Restructuring lattice theory: an approach based on hierarchies of concepts
Rudolf Wille
- 12 May 2009
TL;DR: Restructuring lattice theory is an attempt to reinvigorate connections with the authors' general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattices theory.
2.5K
•Book
Tilting in Abelian Categories and Quasitilted Algebras
Dieter Happel,Idun Reiten,O SmaløSverre +2 more
- 01 Jan 1996
797
Related Papers (5)
Jessica Striker,Nathan Williams +1 more
R P Stanley
- 13 Apr 1997