Papers
Topics
Authors
Recent
Search
2000 character limit reached

Para-exceptional sequences for tame hereditary algebras and McCammond-Sulway lattices

Published 17 Oct 2025 in math.RT and math.CO | (2510.16177v1)

Abstract: Noncrossing partition posets in a Coxeter group $W$ can fail to be lattices when $W$ is not finite. When the lattice property fails for $W$ of affine type, McCammond and Sulway's construction provides a larger lattice that contains the noncrossing partition poset and that furthermore is a combinatorial Garside structure. We construct a lattice, isomorphic to McCammond and Sulway's lattice, using the representation theory of a corresponding connected tame hereditary algebra and give a representation-theoretic proof that it is a combinatorial Garside structure. To construct the lattice, we introduce para-exceptional sequences and para-exceptional subcategories in the module categories of tame hereditary algebras. Para-exceptional sequences are generalizations of exceptional sequences obtained by enlarging the set of allowed entries to include all non-homogeneous bricks. A para-exceptional subcategory is a subcategory obtained by applying a certain closure-like operator to the wide subcategory generated by a para-exceptional sequence.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We found no open problems mentioned in this paper.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.