Papers
Topics
Authors
Recent
Search
2000 character limit reached

A categorification of biclosed sets of strings

Published 30 Aug 2018 in math.RT and math.CO | (1808.10346v1)

Abstract: We consider the closure space on the set of strings of a gentle algebra of finite representation type. Palu, Pilaud, and Plamondon proved that the collection of all biclosed sets of strings forms a lattice, and moreover, that this lattice is congruence-uniform. Many interesting examples of finite congruence-uniform lattices may be represented as the lattice of torsion classes of an associative algebra. We introduce a generalization, the lattice of torsion shadows, and we prove that the lattice of biclosed sets of strings is isomorphic to a lattice of torsion shadows. Finite congruence-uniform lattices admit an alternate partial order known as the shard intersection order. In many cases, the shard intersection order of a congruence-uniform lattice is isomorphic to a lattice of wide subcategories of an associative algebra. Analogous to torsion shadows, we introduce wide shadows, and prove that the shard intersection order of the lattice of biclosed sets is isomorphic to a lattice of wide shadows.

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 haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

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