Mathematics > Number Theory
[Submitted on 19 Oct 2014 (v1), last revised 8 Mar 2015 (this version, v2)]
Title:On the parity conjecture in finite-slope families
View PDFAbstract:We generalize to the finite-slope setting several techniques due to Nekovar concerning the parity conjecture for self-dual motives. In particular we show that, for a $p$-adic analytic family, with irreducible base, of symplectic self-dual global Galois representations whose $(\varphi,\Gamma)$-modules at places lying over $p$ satisfy a Panchishkin condition, the validity of the parity conjecture is constant among all specializations that are pure. As an application, we extend some other results of Nekovar for Hilbert modular forms from the ordinary case to the finite-slope case.
Submission history
From: Jonathan Pottharst [view email][v1] Sun, 19 Oct 2014 08:40:44 UTC (35 KB)
[v2] Sun, 8 Mar 2015 04:29:24 UTC (36 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.