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

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 Sn and the down transition function is induced from the inclusions Sn Sn+1. In this paper we generalize the above framework to the case where \An\n ≥ 0 is any free Frobenius tower and An is no longer assumed to be semisimple. In particular, we describe two coherent systems on graded graphs defined by the representation theory of \An\n ≥ 0 and connect one of these systems to a family of central elements of \An\n ≥ 0. When the algebras \An\n ≥ 0 are not semisimple, the resulting coherent systems reflect the duality between simple An-modules and indecomposable projective An-modules.

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…