2000 character limit reached
On monic abelian cubics
Published 20 Jun 2019 in math.NT | (1906.08625v2)
Abstract: In this paper we prove the assertion that the number of monic cubic polynomials $F(x) = x3 + a_2 x2 + a_1 x + a_0$ with integer coefficients and irreducible, Galois over $\mathbb{Q}$ satisfying $\max{|a_2|, |a_1|, |a_0|} \leq X$ is bounded from above by $O(X (\log X)2)$. We also count the number of abelian monic binary cubic forms with integer coefficients up to a natural equivalence relation ordered by the so-called Bhargava-Shankar height. Finally, we prove an assertion characterizing the splitting field of 2-torsion points of semi-stable abelian elliptic curves
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.