The size of $2$-Selmer groups for the -congruent number problem
This paper establishes an asymptotic formula for the size of relaxed 2-Selmer groups associated with the -congruent number problem using Heath-Brown's strategy, thereby proving the existence of unconditional positive densities for specific 2-Selmer ranks among square-free integers with particular modular and prime divisor constraints.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Technical Summary: The Size of 2-Selmer Groups for the -Congruent Number Problem
Problem Statement
This paper investigates the average rank of the 2-Selmer group associated with the elliptic curves linked to the -congruent number problem. A positive integer is a -congruent number if it represents the area of a rational triangle with an angle . Specifically, the authors focus on the case , where the associated elliptic curve is defined as:
The central object of study is the 2-Selmer rank, denoted , where the size of the 2-Selmer group is . The authors aim to determine the asymptotic behavior of the average value of over specific families of square-free integers .
Methodology
The authors adopt the strategy pioneered by Heath-Brown [H93] for congruent elliptic curves (), adapting it to the specific arithmetic structure of . The methodology proceeds through the following steps:
2-Descent and Homogeneous Systems:
Using the 2-descent method, the authors map the quotient into a product of local fields. They establish a bijection between the 2-Selmer group and the set of solvable systems of homogeneous equations over . Specifically, they derive a system of equations involving four pairwise coprime square-free integers (where ):
The size of the 2-Selmer group, , corresponds to the number of such systems solvable in and all .Local Conditions and Constraints:
The authors rigorously analyze the local solvability conditions at primes dividing . A crucial technical constraint is imposed: the study is restricted to square-free integers such that and every prime divisor of satisfies . Under these conditions, the local groups behave in a controlled manner, allowing the global Selmer group size to be expressed as a sum over factorizations of involving Jacobi symbols.Averaging and Character Sums:
To compute the average size, the authors sum the expression for over the set .- They decompose the sum over the 16 variables arising from the factorization of .
- They employ Heath-Brown's technique of "linked variables" to bound character sums. Variables are considered "linked" if they appear together in a Jacobi symbol.
- Using bounds for character sums (specifically Lemma 3.1 and Lemma 3.3 from [H93] adapted to modulus 24), they show that contributions from configurations with many "large" variables are negligible.
- The main term arises from specific configurations of indices (9 exceptional cases identified in Lemma 4.1) where the variables decouple sufficiently to allow explicit evaluation.
Key Contributions and Results
Main Theorem (Theorem 1.2): For and , the authors prove the following asymptotic formula for the sum of :
This result establishes that the average size of the relaxed 2-Selmer group is exactly 9 times the number of integers in the set.Density of Selmer Ranks:
By combining the main theorem with parity results from Wei-Guo [WG2022], the authors derive unconditional density results:- Case : Since is even, the density of or is at least .
- Case : Since is odd, the density of or is at least .
Implications for Mordell-Weil Rank:
Using the inequality , the authors provide upper bounds for the average Mordell-Weil rank in these families, consistent with the bounds derived for .
Significance and Claims
The paper claims that its results provide unconditional evidence supporting Yoshida's conjecture regarding -congruent numbers. Specifically, the derived densities suggest that a positive proportion of integers in the specified families have low Selmer ranks, which correlates with the existence of rational points on the curves.
The authors highlight a significant deviation from the general heuristics of Bhargava-Kane-Lenstra-Poonen-Rains (BKLPR). While BKLPR predicts a specific distribution based on random matrix theory, the constant 9 in the main theorem reflects a "rigid structure" originating from the 2-isogeny of the curve and the specific local conditions at primes dividing 6. This rigidity causes the distribution of 2-Selmer ranks in this family to differ from the general random matrix predictions.
The authors explicitly note that their technique is currently limited to integers where all prime factors are congruent to . Extending these results to the full set of square-free integers or to the -congruent number problem would require new methods, as the technical difficulties in those cases are substantial. The paper does not claim to resolve the full -congruent number conjecture but provides a foundational asymptotic formula for a specific, well-behaved subfamily.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.