Most Odd-Degree Binary Forms Fail to Primitively Represent a Square
Ashvin Swaminathan

TL;DR
This paper demonstrates that for large odd degrees, most superelliptic equations with fixed non-square leading coefficients are insoluble or fail the local-global principle, extending Faltings' finiteness results to a statistical setting.
Contribution
It provides a quantitative asymptotic analysis of the solubility and local-global failure of superelliptic equations of large odd degree, generalizing Faltings' theorem.
Findings
Over 74.9% of equations are insoluble.
Over 71.8% are locally soluble but violate the Hasse principle.
Proportions increase to over 99.9% and 96.7% with more prime divisors of the leading coefficient.
Abstract
Let be a separable integral binary form of odd degree . A result of Darmon and Granville known as ``Faltings plus epsilon'' implies that the degree- \emph{superelliptic equation} has finitely many primitive integer solutions. In this paper, we consider the family of degree- superelliptic equations with fixed leading coefficient , ordered by height. For every sufficiently large , we prove that among equations in the family , more than are insoluble, and more than are everywhere locally soluble but fail the Hasse principle due to the Brauer--Manin obstruction. We further show that these proportions rise to at least and , respectively, when has sufficiently many prime divisors of odd multiplicity. Our result can be viewed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Coding theory and cryptography · Finite Group Theory Research
