Maximum antichains in posets of quiver representations
Abstract: We study maximum antichains in two posets related to quiver representations. Firstly, we consider the set of isomorphism classes of indecomposable representations ordered by inclusion. For various orientations of the Dynkin diagram of type A we construct a maximum antichain in the poset. Secondly, we consider the set of subrepresentations of a given quiver representation, again ordered by inclusion. It is a finite set if we restrict to linear representations over finite fields or to representations with values in the category of pointed sets. For particular situations we prove that this poset is Sperner.
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.