$\tau$-tilting finiteness and $\mathbf{g}$-tameness: Incidence algebras of posets and concealed algebras
Erlend D. B{\o}rve, Jacob Fjeld Grevstad, Endre S. Rundsveen

TL;DR
This paper characterizes when incidence algebras of finite posets are representation-finite or tame based on $ au$-tilting finiteness and $ extbf{g}$-tameness, using concealed algebra theory.
Contribution
It establishes new criteria linking $ au$-tilting finiteness and $ extbf{g}$-tameness to representation type for incidence algebras, with proofs involving concealed algebras.
Findings
$ au$-tilting finite incidence algebras are representation-finite
$ extbf{g}$-tame incidence algebras are tame
Wild concealed algebras are not $ extbf{g}$-tame
Abstract
We prove that any -tilting finite incidence algebra of a finite poset is representation-finite, and that any -tame incidence algebra of a finite simply connected poset is tame. As the converse of these assertions are known to hold, we obtain characterizations of -tilting finite incidence algebras and -tame simply connected incidence algebras. Both results are proved using the theory of concealed algebras. The former will be deduced from the fact that tame concealed algebras are -tilting infinite, and to prove the latter, we show that wild concealed algebras are not -tame. We conjecture that any incidence algebra of a finite poset is wild if and only if it is not -tame, and prove a result showing that there are relatively few possible counterexamples. In the appendix, we determine the representation type of a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Computability, Logic, AI Algorithms · Advanced Algebra and Logic
