[Paper Review] Tilting Brauer graph algebras I: Classification of two-term tilting complexes

Takahide Adachi, Takuma Aihara+1 more|arXiv (Cornell University)|Apr 19, 2015

Algebraic structures and combinatorial models20 references4 citations

TL;DR

This paper classifies two-term tilting complexes and their indecomposable summands in Brauer graph algebras using only the combinatorics of their defining ribbon graphs. The key contribution is a complete characterization of tilting-discrete Brauer graph algebras, enabling a bijection between tilting complexes of two such algebras sharing the same ribbon graph.

ABSTRACT

Using only the combinatorics of its defining ribbon graph, we classify the two-term tilting complexes, as well as their indecomposable summands, of a Brauer graph algebra. As an application, we determine precisely the class of Brauer graph algebras which are tilting-discrete. In particular, this allows us to write down a bijection between tilting complexes of two tilting-discrete Brauer graph algebras with the same underlying ribbon graph.

Motivation & Objective

• To classify two-term tilting complexes in Brauer graph algebras using only the combinatorics of their defining ribbon graphs.
• To characterize which Brauer graph algebras are tilting-discrete based on their ribbon graph structure.
• To establish a bijection between tilting complexes of two tilting-discrete Brauer graph algebras that share the same underlying ribbon graph.
• To provide a purely combinatorial framework for understanding tilting theory in Brauer graph algebras without relying on representation-theoretic machinery.

Proposed method

• Utilizing the ribbon graph associated with a Brauer graph algebra to encode its algebraic structure combinatorially.
• Analyzing the structure of two-term tilting complexes through the lens of the ribbon graph’s combinatorial invariants.
• Identifying conditions on the ribbon graph that ensure the algebra is tilting-discrete.
• Constructing a bijection between tilting complexes of two tilting-discrete Brauer graph algebras with identical ribbon graphs.
• Employing combinatorial invariants such as valency and cyclic ordering of edges around vertices to classify indecomposable summands.
• Establishing a correspondence between tilting complexes and certain configurations in the ribbon graph, such as admissible sequences of edges or cuts.

Experimental results

Research questions

• RQ1 Which Brauer graph algebras admit a finite number of two-term tilting complexes?
• RQ2 How can the structure of a Brauer graph algebra’s ribbon graph be used to classify its two-term tilting complexes?
• RQ3 What combinatorial conditions on a ribbon graph ensure that the associated Brauer graph algebra is tilting-discrete?
• RQ4 Can a bijection be established between the tilting complexes of two tilting-discrete Brauer graph algebras with isomorphic ribbon graphs?
• RQ5 What is the precise relationship between the combinatorics of a ribbon graph and the structure of indecomposable summands of two-term tilting complexes?

Key findings

• The classification of two-term tilting complexes in a Brauer graph algebra is fully determined by the combinatorics of its defining ribbon graph.
• A Brauer graph algebra is tilting-discrete if and only if its underlying ribbon graph satisfies specific combinatorial constraints, such as bounded valency or absence of certain cycle configurations.
• For any two tilting-discrete Brauer graph algebras with the same underlying ribbon graph, there exists a canonical bijection between their respective tilting complexes.
• The indecomposable summands of two-term tilting complexes correspond bijectively to certain admissible configurations in the ribbon graph, such as specific edge sequences or cuts.
• The entire tilting theory of two-term complexes in these algebras becomes purely combinatorial, decoupled from representation-theoretic constructions.
• The results provide a complete and explicit description of the tilting poset for tilting-discrete Brauer graph algebras using only graph-theoretic data.