English
Related papers

Related papers: A facial order for torsion classes

200 papers

We investigate a poset structure that extends the weak order on a finite Coxeter group $W$ to the set of all faces of the permutahedron of $W$. We call this order the facial weak order. We first provide two alternative characterizations of…

Combinatorics · Mathematics 2023-11-14 Aram Dermenjian , Christophe Hohlweg , Vincent Pilaud

We extend the facial weak order from finite Coxeter groups to central hyperplane arrangements. The facial weak order extends the poset of regions of a hyperplane arrangement to all its faces. We provide four non-trivially equivalent…

Combinatorics · Mathematics 2023-11-14 Aram Dermenjian , Christophe Hohlweg , Thomas McConville , Vincent Pilaud

In this expository note, I present some of the key features of the lattice of torsion classes of a finite-dimensional algebra, focussing in particular on its complete semidistributivity and consequences thereof. This is intended to serve as…

Representation Theory · Mathematics 2021-02-18 Hugh Thomas

Let $A$ be a basic finite-dimensional algebra and denote by $\operatorname{tors} A$ the collection of all all torsion classes of $A$. It has been proved in \cite{Demonet} that $\operatorname{tors} A$ is always a completely semidistributive…

Representation Theory · Mathematics 2025-09-25 Yongle Luo , Jiaqun Wei

The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}}…

Representation Theory · Mathematics 2024-08-13 Laurent Demonet , Osamu Iyama , Nathan Reading , Idun Reiten , Hugh Thomas

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Logic · Mathematics 2008-07-22 Luigi Santocanale

In this paper, we compute the posets of wide subcategories and ICE-closed subcategories from the lattice of torsion classes in an abelian length category in a purely lattice-theoretical way, by using the kappa map in a completely…

Representation Theory · Mathematics 2022-01-04 Haruhisa Enomoto

This paper introduces the notion of extriangulated length categories, whose prototypical examples include abelian length categories and bounded derived categories of finite dimensional algebras with finite global dimension. We prove that an…

Representation Theory · Mathematics 2025-05-15 Li Wang , Jiaqun Wei , Haicheng Zhang , Panyue Zhou

For a finite-dimensional gentle algebra, it is already known that the functorially finite torsion classes of its category of finite-dimensional modules can be classified using a combinatorial interpretation, called maximal non-crossing sets…

Representation Theory · Mathematics 2020-09-23 Aaron Chan , Laurent Demonet

We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…

Combinatorics · Mathematics 2012-03-28 Filippo Disanto , Luca Ferrari , Simone Rinaldi

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

Combinatorics · Mathematics 2009-03-30 Drew Armstrong

We situate the noncrossing partitions associated to a finite Coxeter group within the context of the representation theory of quivers. We describe Reading's bijection between noncrossing partitions and clusters in this context, and show…

Representation Theory · Mathematics 2014-01-14 Colin Ingalls , Hugh Thomas

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Combinatorics · Mathematics 2025-12-23 Grant T. Barkley , David E Speyer

A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…

Commutative Algebra · Mathematics 2026-02-17 Takayuki Hibi , Seyed Amin Seyed Fakhari

For some important families of complete infinite lattices, we study some generalizations of two fundamental notions which are mostly treated for finite lattices. Specifically, for well-separated $\kappa$-lattices, and also for weakly atomic…

Rings and Algebras · Mathematics 2026-04-24 Sota Asai , Osamu Iyama , Kaveh Mousavand , Charles Paquette

We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…

Combinatorics · Mathematics 2007-05-23 Patricia Palacios , Maria Ronco

We study two classes of torsion classes which generalize functorially finite torsion classes, that is, semistable torsion classes and morphism torsion classes. Semistable torsion classes are parametrized by the elements in the real…

Representation Theory · Mathematics 2023-05-22 Sota Asai , Osamu Iyama

A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…

Group Theory · Mathematics 2025-02-20 Jani Jokela

Let $\Lambda$ be a finite-dimensional associative algebra. The torsion classes of $mod\, \Lambda$ form a lattice under containment, denoted by $tors\, \Lambda$. In this paper, we characterize the cover relations in $tors\, \Lambda$ by…

Representation Theory · Mathematics 2017-10-25 Emily Barnard , Andrew T. Carroll , Shijie Zhu

We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…

Combinatorics · Mathematics 2022-01-26 Szymon Głcab , Michał Pawlikowski
‹ Prev 1 2 3 10 Next ›