اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMinoration de la hauteur de Neron-Tate sur les surfaces abeliennes
250
0
0.0
(
0
)
تأليف
Fabien Pazuki
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper contains results concerning a conjecture made by Lang and Silverman predicting a lower bound for the canonical height on abelian varieties of dimension 2 over number fields. The method used here is a local height decomposition. We derive as corollaries uniform bounds on the number of torsion points on families of abelian surfaces and on the number of rational points on families of genus 2 curves.
قيم البحث
اقرأ أيضاً
Let X_d be the p-adic analytic space classifying the d-dimensional (semisimple) p-adic Galois representations of the absolute Galois group of Q_p. We show that the crystalline representations are Zarski-dense in many irreducible components of X_d, in
cluding the components made of residually irreducible representations. This extends to any dimension d previous results of Colmez and Kisin for d = 2. For this we construct an analogue of the infinite fern of Gouv^ea-Mazur in this context, based on a study of analytic families of trianguline (phi,Gamma)-modules over the Robba ring. We show in particular the existence of a universal family of (framed, regular) trianguline (phi,Gamma)-modules, as well as the density of the crystalline (phi,Gamma)-modules in this family. These results may be viewed as a local analogue of the theory of p-adic families of finite slope automorphic forms, they are new already in dimension 2. The technical heart of the paper is a collection of results about the Fontaine-Herr cohomology of families of trianguline (phi,Gamma)-modules.
We give a new definition, simpler but equivalent, of the abelian category of Banach-Colmez spaces introduced by Colmez, and we explain the precise relationship with the category of coherent sheaves on the Fargues-Fontaine curve. One goes from one cat
egory to the other by changing the t-structure on the derived category. Along the way, we obtain a description of the pro-etale cohomology of the open disk and the affine space, of independent interest.
We introduce a notion of positive pair of contact structures on a 3-manifold which generalizes a previous definition of Eliashberg-Thurston and Mitsumatsu. Such a pair gives rise to a locally integrable plane field $lambda$. We prove that if $lambda$
is uniquely integrable and if both structures of the pair are tight, then the integral foliation of $lambda$ doesnt contain any Reeb component whose core curve is homologous to zero. Moreover, the ambient manifold carries a Reebless foliation. We also show a stability theorem `a la Reeb for positive pairs of tight contact structures.
Let F be a finite extension of Qp, O_F its ring of integers and E a finite extension of Fp. The natural action of the unit group O_F* on O_F extends in a continuous action on the Iwasawa algebra E[[O_F]]. In this work, we show that non zero ideals of
E[[O_F]] which are stable under O_F* are open. As a consequence, we deduce the fidelity of the action of E[[U]], with U the subgroup of upper unipotent matrices in GL2(O_F) on an irreducible admissible smooth E-representation of GL2(F). ----- Soit F une extension finie de Qp, danneau des entiers O_F et E une extension finie de Fp. Laction naturelle du groupes des unites O_F* sur O_F se prolonge alors en une action continue sur lalg`ebre dIwasawa E[[O_F]]. Dans ce travail, on demontre que les ideaux non nuls de E[[O_F]] stables par O_F* sont ouverts. En particulier, on en deduit la fidelite de laction de lalg`ebre dIwasawa des matrices unipotentes superieures de GL2(O_F) sur une representation lisse irreductible admissible de GL2(F).
Bitmap indexes are frequently used to index multidimensional data. They rely mostly on sequential input/output. Bitmaps can be compressed to reduce input/output costs and minimize CPU usage. The most efficient compression techniques are based on run-
length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression. This type of compression accelerates logical operations (AND, OR) over the bitmaps. However, run-length encoding is sensitive to the order of the facts. Thus, we propose to sort the fact tables. We review lexicographic, Gray-code, and block-wise sorting. We found that a lexicographic sort improves compression--sometimes generating indexes twice as small--and make indexes several times faster. While sorting takes time, this is partially offset by the fact that it is faster to index a sorted table. Column order is significant: it is generally preferable to put the columns having more distinct values at the beginning. A block-wise sort is much less efficient than a full sort. Moreover, we found that Gray-code sorting is not better than lexicographic sorting when using word-aligned compression.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
