Recursive construction of central idempotents in partition algebras

Let DrD_r and DrD'_r be the partition-algebra objects containing the rank-one central idempotents E(r)E(r) and E(r)E'(r), respectively. Let hih_i, sis_i, and pip_i denote the generators defined by the corresponding partition diagrams, and let ρ\rho be the one-dimensional representation used to define these idempotents. Recursive idempotent construction. The idempotents E(r)DrE(r)\in D_r and E(r)DrE'(r)\in D'_r are constructed recursively by E(1)=1E'(1)=1 and

E(r)=1rE(r)[1+(r1)sr11δ2r+2pr]E(r)E(r) = \frac1r E'(r)\left[ 1+(r-1)s_{r-1} -\frac1{\delta-2r+2}p_r \right] E'(r) E(r+1)=E(r)[1r(δ2r+2δ2r+1)hr]E(r).E'(r+1) = E(r)\left[ 1 - r\left(\frac{\delta-2r+2}{\delta-2r+1}\right)h_r \right] E(r).

This gives an explicit recursive description of the central idempotents associated with the one-dimensional representations of the partition algebras. The source presents the assertion as a conjecture, and no resolution is supplied here.

Sources & referencesView supporting material

Primary source

Martin Rubey and Bruce W. Westbury, “A combinatorial approach to classical representation theory”, arXiv:1408.3592 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.