<p>We classify <i>n</i>-representation infinite algebras <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\Lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="normal">Λ</mi> </math></EquationSource> </InlineEquation> of type <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\tilde{A}\)</EquationSource> <EquationSource Format="MATHML"><math> <mover accent="true"> <mi>A</mi> <mo stretchy="false">~</mo> </mover> </math></EquationSource> </InlineEquation>. This type is defined by requiring that <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\Lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="normal">Λ</mi> </math></EquationSource> </InlineEquation> has higher preprojective algebra <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\Pi _{n+1}(\Lambda ) \simeq k[x_1, \ldots , x_{n+1}] *G\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="normal">Π</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="normal">Λ</mi> <mo stretchy="false">)</mo> </mrow> <mo>≃</mo> <mi>k</mi> <mrow> <mo stretchy="false">[</mo> <msub> <mi>x</mi> <mn>1</mn> </msub> <mo>,</mo> <mo>…</mo> <mo>,</mo> <msub> <mi>x</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo stretchy="false">]</mo> </mrow> <mrow /> <mo>∗</mo> <mi>G</mi> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(G \le {{\,\textrm{SL}\,}}_{n+1}(k)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>G</mi> <mo>≤</mo> <msub> <mrow> <mspace width="0.166667em" /> <mtext>SL</mtext> <mspace width="0.166667em" /> </mrow> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>k</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> is finite abelian. For the classification, we group these algebras according to a more refined type, and give a combinatorial characterisation of these types. This is based on so-called height functions, which generalise the height function of a perfect matching in a dimer model. In terms of toric geometry and McKay correspondence, the types form the lattice simplex of junior elements of <i>G</i>. We show that all algebras of the same type are related by iterated <i>n</i>-APR tilting, and hence are derived equivalent. By disallowing certain tilts, we turn this set into a finite distributive lattice, and we construct its maximal and minimal elements.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A classification of n-representation infinite algebras of type \(\tilde{A}\)

  • Darius Dramburg,
  • Oleksandra Gasanova

摘要

We classify n-representation infinite algebras \(\Lambda \) Λ of type \(\tilde{A}\) A ~ . This type is defined by requiring that \(\Lambda \) Λ has higher preprojective algebra \(\Pi _{n+1}(\Lambda ) \simeq k[x_1, \ldots , x_{n+1}] *G\) Π n + 1 ( Λ ) k [ x 1 , , x n + 1 ] G , where \(G \le {{\,\textrm{SL}\,}}_{n+1}(k)\) G SL n + 1 ( k ) is finite abelian. For the classification, we group these algebras according to a more refined type, and give a combinatorial characterisation of these types. This is based on so-called height functions, which generalise the height function of a perfect matching in a dimer model. In terms of toric geometry and McKay correspondence, the types form the lattice simplex of junior elements of G. We show that all algebras of the same type are related by iterated n-APR tilting, and hence are derived equivalent. By disallowing certain tilts, we turn this set into a finite distributive lattice, and we construct its maximal and minimal elements.