Brauer tree algebras have $\binom{2n}{n}$ $2$-tilting complexes

TL;DR

This paper counts the exact number of 2-tilting complexes for Brauer tree algebras, revealing a combinatorial formula linked to the structure of the associated Brauer tree.

Contribution

It provides a precise enumeration of 2-tilting complexes for Brauer tree algebras using geometric models and classification results.

Findings

Number of 2-tilting complexes is inom{2n}{n} for a Brauer tree algebra with n edges.

Explicit count of complexes with a given g-vector component.

Application of geometric models and classification theorems to derive combinatorial formulas.

Abstract

We show that any Brauer tree algebra has precisely $\binom{2n}{n}$ $2$-tilting complexes, where $n$ is the number of edges of the associated Brauer tree. More explicitly, for an external edge $e$ and an integer $j\neq0$, we show that the number of $2$-tilting complexes $T$ with $g_e(T)=j$ is $\binom{2n-|j|-1}{n-1}$, where $g_e(T)$ denotes the $e$-th of the $g$-vector of $T$. To prove this, we use a geometric model of Brauer graph algebras on the closed oriented marked surfaces and a classification of $2$-tilting complexes due to Adachi-Aihara-Chan.