Primitive partial permutation representations of the polycyclic monoids and branching function systems. (Q1046885)

The polycyclic monoid \(P_n\) is the monoid with zero given by the following presentation \[ \{a_1,a_2,\dots,a_n,a_1^{-1},a_2^{-1},\dots,a_n^{-1};\;\forall i\;(a_i^{-1}a_i=1),\;\forall i,j\;i\neq j\;(a_j^{-1}a_i=0)\}. \] It is proved that there exists a bijection between right congruences of a free monoid with \(n\) generators and wide inverse submonoids of \(P_n\) (we recall that a submonoid \(A\) of a monoid \(M\) is wide if \(A\) contains all idempotents of \(M\)). The proper closed inverse submonoids of \(P_n\) are classified and described. Representations of \(P_n\) by partial permutations of a set \(X\) are studied and the relation of representations of \(P_n\) and branching function systems is presented.