English

Exceptional Sequences and Idempotent Functions

Representation Theory 2019-10-02 v2 Combinatorics

Abstract

We prove that there is a one to one correspondence between the following three sets: idempotent functions on a set of size nn, complete exceptional sequences of linear radical square zero Nakayama algebras of rank nn and rooted labeled forests with nn nodes and height of at most one. Therefore, the number of exceptional sequences is given by the sum j=1n(nj)jnj\sum\limits^n_{j=1}\binom{n}{j}j^{n-j}.

Keywords

Cite

@article{arxiv.1909.05887,
  title  = {Exceptional Sequences and Idempotent Functions},
  author = {Emre Sen},
  journal= {arXiv preprint arXiv:1909.05887},
  year   = {2019}
}

Comments

Minor changes

R2 v1 2026-06-23T11:13:55.425Z