Search arXivSearch

arXiv · 1002.2260

Strong Weil curves over F_q(T) with small conductor

Abstract

We continue work of Gekeler and others on elliptic curves over ${\mathbb F}_q(T)$ with conductor $\infty\cdot{\mathfrak n}$ where ${\mathfrak n}\in{\mathbb F}_q[T]$ has degree 3. Because of the Frobenius isogeny there are infinitely many curves in each isogeny class, and we discuss in particular which of these curves is the strong Weil curve with respect to the uniformization by the Drinfeld modular curve $X_0({\mathfrak n})$. As a corollary we obtain that the strong Weil curve $E/{\mathbb F}_q(T)$ always gives a rational elliptic surface over $\bar{{\mathbb F}_q}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Schweizer. 2010-10-22. Strong Weil curves over F_q(T) with small conductor. https://doi.org/10.1016/j.jnt.2010.08.007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT