Optimal large sieve for fixed order characters
Let $n \geq 3$. We improve the large sieve inequality for $n$-th order Hecke characters over any number field containing the $n$-th roots of unity. Our bound is expected to be optimal in all ranges of parameters. Several applications are deduced, including a tight upper bound for the second moment of cubic characters o...