On the Combinatorics of F1-Representations of Pseudotree Quivers

Abstract

We investigate quiver representations over F1. Coefficient quivers are combinatorial gadgets equivalent to F1-representations of quivers. We focus on the case when the quiver Q is a pseudotree. For such quivers, we first use the notion of coefficient quivers to provide a complete classification of asymptotic behaviors of indecomposable representations over F1. Then, we prove some fundamental structural results about the Lie algebras associated to pseudotrees. Finally, we construct examples of F1-representations M of a quiver Q by using coverings, under which the Euler characteristics of the quiver Grassmannians GrQd(M) can be computed in a purely combinatorial way.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…