Skip to content
DraconiticResearch
Search Sources API
197,357 studies31 sourcesUpdated 5 min ago
PreprintarXiv licencearXiv

Symplectic extension graphs and Ribet's lemma

Abstract

Let p be an odd prime, and let ρ: G→ GSp2n(Zp) be an irreducible symplectic residually multiplicity free representation. We define the symplectic extension graph ΓρGSp 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 GSp2n(Qp), under some assumptions, we prove the existence of certain paths in ΓρGSp and show that ΓρGSp is a disjoint union of nonempty strongly connected subgraphs. Moreover, we provide examples to show that the result we obtain is optimal.

Related

  1. Wide Regular Subalgebras of Symmetrizable Kac-Moody Algebras and an Extension of Schur's Lemma
    Andrew Douglas, Abid Ali
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Ribet Points, geometric divisibility sequence and order of reductions on semiabelian varieties
    Khai-Hoan Nguyen-Dang
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. The Composition Lemma for n-dependence
    Artem Chernikov, Yuyan He
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  4. The Kaplansky-Walker Lemma for additive categories
    Simion Breaz, Cristian Rafiliu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. A Lê number addendum to the Morse Splitting Lemma
    David B. Massey
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{sudarshan2026symplectic,
  title = {{Symplectic extension graphs and Ribet's lemma}},
  author = {Aniruddha Sudarshan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.19434},
  eprint = {2610.19434},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.19434},
}
RIS
TY  - UNPB
TI  - Symplectic extension graphs and Ribet's lemma
AU  - Aniruddha Sudarshan
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2610.19434
UR  - https://arxiv.org/abs/2610.19434
AB  - Let p be an odd prime, and let ρ: G→ GSp_2n(Z_p) be an irreducible symplectic residually multiplicity free representation. We define the symplectic extension graph Γ_ρ^GSp 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 GSp_2n(Q_p), under some assumptions, we prove the existence of certain paths in Γ_ρ^GSp and show that Γ_ρ^GSp is a disjoint union of nonempty strongly connected subgraphs. Moreover, we provide examples to show that the result we obtain is optimal.
ER  -