2000 character limit reached
Exceptional Sequences and Idempotent Functions
Published 12 Sep 2019 in math.RT and math.CO | (1909.05887v2)
Abstract: We prove that there is a one to one correspondence between the following three sets: idempotent functions on a set of size $n$, complete exceptional sequences of linear radical square zero Nakayama algebras of rank $n$ and rooted labeled forests with $n$ nodes and height of at most one. Therefore, the number of exceptional sequences is given by the sum $\sum\limitsn_{j=1}\binom{n}{j}j{n-j}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.