Papers
Topics
Authors
Recent
Search
2000 character limit reached

Stable representations of posets

Published 3 Jul 2017 in math.RT and math.SG | (1707.00396v2)

Abstract: The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type is stable with respect to some weight and construct that weight explicitly in terms of the dimension vector. We show that if a poset is primitive then Coxeter transformations preserve stable representations. When the base field is the field of complex numbers we establish the connection between the polystable representations and the unitary $\chi$-representations of posets. This connection explains the similarity of the results obtained in the series of papers.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.