Coherent systems of probability measures on graphs for representations of free Frobenius towers
Henry Kvinge

TL;DR
This paper extends the concept of coherent probability measures on graphs to non-semisimple free Frobenius towers, linking representation theory with probabilistic structures and dualities.
Contribution
It generalizes the framework of coherent systems to non-semisimple algebras and connects these systems to central elements and module dualities.
Findings
Defined two coherent systems for free Frobenius towers
Connected one system to central elements of the algebras
Captured duality between simple modules and projective modules
Abstract
First formally defined by Borodin and Olshanski, a coherent system on a graded graph is a sequence of probability measures which respect the action of certain down/up transition functions between graded components. In one common example of such a construction, each measure is the Plancherel measure for the symmetric group and the down transition function is induced from the inclusions . In this paper we generalize the above framework to the case where is any free Frobenius tower and is no longer assumed to be semisimple. In particular, we describe two coherent systems on graded graphs defined by the representation theory of and connect one of these systems to a family of central elements of . When the algebras are not semisimple, the resulting coherent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Geometry · Advanced Topics in Algebra
