Search arXivSearch

arXiv · 2401.13577

Three-Torsion Subgroups and Wild Conductor Exponents of Plane Quartics

Abstract

In this paper we give an algorithm to find the 3-torsion subgroup of the Jacobian of a smooth plane quartic curve with a marked rational point. We describe $3-$torsion points in terms of cubics which triply intersect the curve, and use this to define a system of equations whose solution set corresponds to the coefficients of these cubics. We compute the points of this zero-dimensional, degree $728$ scheme first by approximation, using homotopy continuation and Newton-Raphson, and then using continued fractions to obtain accurate expressions for these points. We describe how the Galois structure of the field of definition of the $3$-torsion subgroup can be used to compute local wild conductor exponents, including at $p=2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elvira Lupoian, James Rawson. 2025-10-10. Three-Torsion Subgroups and Wild Conductor Exponents of Plane Quartics. https://doi.org/10.1007/s40993-025-00672-4

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