Conjectured error term for class numbers of orders in quartic fields
Statement
Let be a finite, non-empty set of prime numbers with an even number of elements, and let and be as in Theorem 1. For , let denote the associated counting function , and define
Class-number asymptotic conjecture. Under the conditions of Theorem 1, as one has
The paper proves the leading asymptotic but explains that its method does not preserve the sharper error term available from the Prime Geodesic Theorem. This conjecture predicts an error of order for the class-number counting function.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.