Upper bounds for the number of primitive ray class characters with conductor below a given bound

TL;DR

This paper establishes upper bounds on sums related to Artin's primitive root conjecture, aiding in counting ray class characters with conductors below a specified limit.

Contribution

It provides new upper bounds for sums connected to primitive ray class characters, advancing understanding in algebraic number theory.

Findings

Derived upper bounds for sums related to ray class characters

Enhanced tools for counting primitive ray class characters

Contributed to the theoretical framework of Artin's primitive root conjecture

Abstract

We present upper bounds on certain sums which are related to Artin's primitive root conjecture and are also used in counting ray class characters.