Search arXivSearch

arXiv · 2609.19085

Tunnell-type criteria for variants of the congruent number problem

Abstract

We study the $θ$-congruent number problem for $\cosθ=\pm3/5$ and $\pm4/5$ using the generalized theta series construction of Sirolli--Tornaría. We describe its specialization to newforms of weight $2$ over $\mathbb Q$ with nontrivial square-free odd part of the level, and explain the reduction of quadratic twists to odd fundamental discriminants. The same construction gives an effective procedure for every $θ$-congruent number problem with nonzero rational cosine. For the four angles, we construct explicit forms of weight $3/2$ whose Fourier coefficients determine the central $L$-values of the associated elliptic curves. This gives Tunnell-type criteria for every positive square-free integer: a nonzero coefficient implies non-$θ$-congruence unconditionally, and the converse holds assuming the Birch--Swinnerton-Dyer conjecture. We also prove unconditional non-$θ$-congruence for primes in explicit arithmetic progressions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bo-Hae Im, Minseo Shin. 2026-09-16. Tunnell-type criteria for variants of the congruent number problem. https://arxiv.org/abs/2609.19085

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