Symplectic extension graphs and Ribet's lemma
Aniruddha Sudarshan
Abstract
Let p be an odd prime, and let ρ G 2n(p) be an irreducible symplectic residually multiplicity free representation. We define the symplectic extension graph Γρ associated with ρ to be the directed graph whose vertices are the residual factors of ρ and a directed edge between two vertices corresponds to a nonsplit extension between the vertices realized by ρ. Using the Euclidean Bruhat--Tits building associated with 2n(p), under some assumptions, we prove the existence of certain paths in Γρ and show that Γρ is a disjoint union of nonempty strongly connected subgraphs. Moreover, we provide examples to show that the result we obtain is optimal.
Create a lesson
Related papers
Universally extendible characters
Benjamin Sambale
Gaudin from Cherednik
Matthew McMillan
Uniqueness of twisted linear periods over Archimedean division algebras
Yufeng Li, Junyan Xiao
Index for a mutation loop
Tsukasa Ishibashi, Yuji Terashima
Minimal presentations of finite-dimensional representations of pseudocompact algebras
Christof Geiss, Carolin Hartung, Daniel Labardini-Fragoso et al.
Automorphisms of medium algebras and quasi-anisotropic real affine Grassmannians
Mischa Elkner