Skip to main content
QUICK REVIEW

[Paper Review] M-cluster tilted algebras of type A tilde

Viviana Gubitosi|arXiv (Cornell University)|Jun 29, 2015
Algebraic structures and combinatorial models3 citations
TL;DR

This paper provides a complete classification of $m$-cluster tilted algebras of type $ ilde{bA}$ by characterizing their quivers and relations. Using a geometric model of $(m+2)$-angulations of annuli, the authors prove that such algebras are gentle and satisfy specific combinatorial constraints on cycles, relations, and orientation, with the key result being a precise characterization of the bound quivers that arise as $m$-cluster tilted algebras of type $ ilde{bA}$.

ABSTRACT

In this paper, we characterize all the finite dimensional algebras that are m-cluster tilted algebras of type A tilde. We show that these algebras are gentle and we give an explicit description of their quivers with relations.

Motivation & Objective

  • To classify all finite-dimensional $m$-cluster tilted algebras of type $ ilde{bA}$ in terms of quivers and relations.
  • To establish that these algebras are gentle, extending known results from the $m=1$ case.
  • To provide a geometric realization of $m$-cluster categories of type $ ilde{bA}$ using $(m+2)$-angulations of annuli with marked points.
  • To characterize the combinatorial structure of the bound quivers, particularly concerning $m$-saturated cycles and internal relations.
  • To prove that the root cycle must satisfy specific balance conditions between clockwise and counterclockwise internal relations modulo $m$.

Proposed method

  • Utilizes the geometric model of $m$-cluster categories of type $ ilde{bA}$ developed by Torkildsen, based on $(m+2)$-angulations of annuli.
  • Applies the correspondence between vertices of the quiver and diagonals in the annulus, with arrows indicating adjacency and relations indicating crossing patterns.
  • Defines $m$-saturated cycles as those where the number of relations in each direction is divisible by $m$, ensuring consistency in the algebraic structure.
  • Imposes combinatorial constraints: at most $m-1$ consecutive relations outside $m$-saturated cycles, and internal relations must balance modulo $m$.
  • Uses the concept of a root cycle $ ilde{bC}$ to define the algebra’s structure, with additional cycles required to be $m$-saturated.
  • Applies results from gentle algebra theory and derived equivalence to verify that the constructed algebras are indeed $m$-cluster tilted.

Experimental results

Research questions

  • RQ1Which finite-dimensional algebras arise as connected components of $m$-cluster tilted algebras of type $ ilde{bA}$?
  • RQ2What are the necessary and sufficient conditions on the quiver and relations for an algebra to be $m$-cluster tilted of type $ ilde{bA}$?
  • RQ3How do the geometric properties of $(m+2)$-angulations of annuli correspond to the algebraic structure of $m$-cluster tilted algebras?
  • RQ4What constraints must be satisfied by cycles and relations in the quiver to ensure the algebra is gentle and $m$-cluster tilted?
  • RQ5How does the balance between clockwise and counterclockwise internal relations on the root cycle affect the algebra’s structure modulo $m$?

Key findings

  • All $m$-cluster tilted algebras of type $ ilde{bA}$ are gentle algebras, generalizing a known result for $m=1$.
  • The bound quiver of such an algebra must contain at most one non-$m$-saturated cycle, which serves as the root cycle.
  • If the root cycle is oriented, it must contain at least one internal relation to satisfy the algebraic constraints.
  • All cycles other than the root cycle must be $m$-saturated, meaning the number of relations in each direction is divisible by $m$.
  • Outside of $m$-saturated cycles, there can be at most $m-1$ consecutive relations, ensuring no new $m$-saturated structure is formed.
  • The number of clockwise-oriented internal relations on the root cycle must be congruent modulo $m$ to the number of counterclockwise-oriented internal relations.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.