Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A categorification of biclosed sets of strings (1808.10346v1)

Published 30 Aug 2018 in math.RT and math.CO

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

We haven't generated a summary for this paper yet.