most citedBranching graphs for finite unitary groups in non-defining characteristic

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2019

A positive combinatorial formula for symplectic Kostka-Foulkes polynomials I: Rows

Maciej Dołęga, Thomas Gerber, Jacinta Torres

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To sh…

math.RT2015★ 2 cited

Branching graphs for finite unitary groups in non-defining characteristic

Thomas Gerber, Gerhard Hiss

We show that the modular branching rule (in the sense of Harish-Chandra) on unipotent modules for finite unitary groups is piecewise described by particular connected components of…