2004
DOI: 10.1090/s0894-0347-04-00449-7
|View full text |Cite
|
Sign up to set email alerts
|

Foliations in moduli spaces of abelian varieties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
53
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 74 publications
(54 citation statements)
references
References 20 publications
1
53
0
Order By: Relevance
“…We note that, unlike the a-number, p-rank, or the final type, the Newton polygon of a Dieudonné module D is not determined by D/pD. The question of which Newton polygons are compatible with which final types is a subject of active research [21]. Our expectation is that the probability distribution on the Newton polygon of D ll , conditional on the p-corank of D being c, should be given by the probability distribution on Newton polygons of nilpotent p-autodual matrices on Z 2c p .…”
Section: Other Statistics and Questions: Final Types And Newton Polygonsmentioning
confidence: 97%
“…We note that, unlike the a-number, p-rank, or the final type, the Newton polygon of a Dieudonné module D is not determined by D/pD. The question of which Newton polygons are compatible with which final types is a subject of active research [21]. Our expectation is that the probability distribution on the Newton polygon of D ll , conditional on the p-corank of D being c, should be given by the probability distribution on Newton polygons of nilpotent p-autodual matrices on Z 2c p .…”
Section: Other Statistics and Questions: Final Types And Newton Polygonsmentioning
confidence: 97%
“…Proof. When n = ∞, the existence of a scheme A g,ξ satisfying (3.1) is [23,Theorem 3.3]; there, such a scheme is called a 'central leaf'. For finite n, see, for example [27,Theorem 1.2].…”
Section: Stratifications On a Gmentioning
confidence: 99%
“…It has been understood for some time that A g,ξ is pure of codimension dim Aut(ξ) in A g [27,28]. For smoothness, we model our proof on that of [23,Theorem 3.13], which proves the smoothness in the case when n = ∞. (See also [27, § 4].)…”
Section: Stratifications On a Gmentioning
confidence: 99%
See 2 more Smart Citations