Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lehmer problem and Drinfeld modules (1302.0152v4)

Published 1 Feb 2013 in math.NT

Abstract: We propose a lower bound estimate in Dobrowolski's style of the canonical height on a certain family of Drinfeld modules of characteristic 0, including under some hypothesis on their degree and their base field, the complex multiplication case, extending so a previous result of L. Denis on Carlitz modules. Our study is focused on the highest possible level of precision on the parameters involved with rapport to the main values which characterize the Drinfeld module (height, base field degree and rank) and it provides an estimate in function of both separable and inseparable degree of the algebraic points.

Summary

We haven't generated a summary for this paper yet.