Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Lattice Properties of Oriented Exchange Graphs and Torsion Classes

Lattice Properties of Oriented Exchange Graphs and Torsion Classes

Thumbnail Image
Download
Name

10468_2017_Article_9757.xml.Meta

Size

10.66 KB

Format

XML

Checksum (MD5)

139a2d912d1a07bf781565632cd7ab2e

Thumbnail Image
Download
Name

10468_2017_9757_ReferencePDF.pdf

Size

590.24 KB

Format

Adobe PDF

Checksum (MD5)

c8ad0272ba59b7b12d569057d4dcdf98

Download all files submitted through automated deposit
art_1511257932809211514.zip (527.89 KB)
Author(s)
Garver, Alexander
•
McConville, Thomas
Date Issued
December 2017
Journal
Algebras and Representation Theory
Publisher
Springer Science and Business Media LLC
Citation
Garver, Alexander and Thomas McConville. “Lattice Properties of Oriented Exchange Graphs and Torsion Classes.” Algebras and Representation Theory 22, 1 (December 2017): 43–78. © 2017 Springer Science Business Media B.V., part of Springer Nature
Version
Author's final manuscript
Abstract
The exchange graph of a 2-acyclic quiver is the graph of mutation-equivalent quivers whose edges correspond to mutations. When the quiver admits a nondegenerate Jacobi-finite potential, the exchange graph admits a natural acyclic orientation called the oriented exchange graph, as shown by Brüstle and Yang. The oriented exchange graph is isomorphic to the Hasse diagram of the poset of functorially finite torsion classes of a certain finite dimensional algebra. We prove that lattices of torsion classes are semidistributive lattices, and we use this result to conclude that oriented exchange graphs with finitely many elements are semidistributive lattices. Furthermore, if the quiver is mutation-equivalent to a type A Dynkin quiver or is an oriented cycle, then the oriented exchange graph is a lattice quotient of a lattice of biclosed subcategories of modules over the cluster-tilted algebra, generalizing Reading’s Cambrian lattices in type A. We also apply our results to address a conjecture of Brüstle, Dupont, and Pérotin on the lengths of maximal green sequences.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/130080
DOI of Published Version
https://doi.org/10.1007/s10468-017-9757-1
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.