paper

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

arXiv:1810.11555

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 systems reflect the duality between simple -modules and indecomposable projective -modules.

24 pages