Full computation of Howe duality restrictions over finite fields yields recursive irrep constructions for symplectic and orthogonal groups plus proofs of rank and exhaustion conjectures for type C.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.RT 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Explicitly identifies the stable eta and zeta correspondences in Howe duality for finite fields using Lusztig's parametrization, linking them to pairs of irreducible representations with non-zero multiplicity as previously proved by S.-Y. Pan.
citing papers explorer
-
Howe duality over finite fields III: Full computation and the Gurevich-Howe conjectures
Full computation of Howe duality restrictions over finite fields yields recursive irrep constructions for symplectic and orthogonal groups plus proofs of rank and exhaustion conjectures for type C.
-
Howe duality over finite fields II: Explicit stable computation
Explicitly identifies the stable eta and zeta correspondences in Howe duality for finite fields using Lusztig's parametrization, linking them to pairs of irreducible representations with non-zero multiplicity as previously proved by S.-Y. Pan.