Related papers: Oriented Flip Graphs and Noncrossing Tree Partitio…
We study 2-term tilting complexes of Brauer tree algebras in terms of simplicial complexes. We show the symmetry and convexity of the simplicial complexes as lattice polytopes. Via a geometric interpretation of derived equivalences, we show…
We consider module categories of path algebras of connected acyclic quivers. It is shown in this paper that the set of functorially finite torsion classes form a lattice if and only if the quiver is either Dynkin quiver of type A, D, E, or…
We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
We introduce $n(n-1)/2$ natural involutions ("toggles") on the set $S$ of noncrossing partitions $\pi$ of size $n$, along with certain composite operations obtained by composing these involutions. We show that for many operations $T$ of…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…
We introduce the notion of brick-splitting torsion pairs as a modern analogue and generalization of the classical notion of splitting torsion pairs. A torsion pair is called brick-splitting if any given brick is either torsion or…
We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group $G(e,e,r)$. For the particular case $e=2$ (resp. $r=2$), our lattice coincides with the lattice of simple…
In the present paper we study twisted foldings of root systems which generalize usual involutive foldings corresponding to automorphisms of Dynkin diagrams. Our motivating example is the Lusztig projection of the root system of type $E_8$…
Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice…
We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…
The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set $\{1,2,\dots, n\}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting…
For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…
We interpret the support $\tau$-tilting complex of any gentle bound quiver as the non-kissing complex of walks on its blossoming quiver. Particularly relevant examples were previously studied for quivers defined by a subset of the grid or…
Non-crossing partitions have been a staple in combinatorics for quite some time. More recently, they have surfaced (sometimes unexpectedly) in various other contexts from free probability to classifying spaces of braid groups. Also,…
For affine Coxeter groups of affine types $\tilde D$ and $\tilde B$, we model the interval $[1,c]_T$ in the absolute order by symmetric noncrossing partitions of an annulus with one or two double points. In type $\tilde B$ (and…
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
We define a new family of noncommutative generalizations of cluster algebras called polygonal cluster algebras. These algebras generalize the noncommutative surfaces of Berenstein-Retakh, and are inspired by the emerging theory of…