Hasse-Arf filtrations in $p$-adic analytic geometry -- Fourth Release

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

58 pages. Final release. This will also appear on http://math.univ-lille1.fr/~ramero The title has changed

Scientific paper

We the study of the monodromy of local systems with bounded ramification on a punctured disc defined over a non-archimedean valued field of characteristic zero. First, we construct the local Fourier transforms and we establish their main properties. Also, we show that the Fourier transform of a "perverse sheaf" with bounded ramification on the affine line, is again a "perverse sheaf" with bounded ramification (we put that in quotes, because actually the language of perversity is not used). These foundations are then used to exhibit a natural break decomposition for local systems with bounded ramification, analogous to the classical one for Galois representation. This is the paper that was previously posted with the title "Local monodromy in non-archimedean analytic geometry -- II". This revised release contains a new section, with an application to the problem of localization of the determinant of cohomology.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Hasse-Arf filtrations in $p$-adic analytic geometry -- Fourth Release does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hasse-Arf filtrations in $p$-adic analytic geometry -- Fourth Release, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hasse-Arf filtrations in $p$-adic analytic geometry -- Fourth Release will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-642784

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.