2000 character limit reached
Bounded gaps between product of two primes in imaginary quadratic number fields
Published 6 Nov 2017 in math.NT | (1711.01949v3)
Abstract: We study the gaps between products of two primes in imaginary quadratic number fields using a combination of the methods of Goldston-Graham-Pintz-Yildirim \cite{GGPY}, and Maynard \cite{MAY}. An important consequence of our main theorem is existence of infinitely many pairs $\alpha_1, \alpha_2$ which are product of two primes in the imaginary quadratic field $K$ such that $|\sigma(\alpha_1-\alpha_2)|\leq 2$ for all embedding $\sigma$ of $K$ if the class number of $K$ is one and $|\sigma(\alpha_1-\alpha_2)|\leq 8$ for all embedding $\sigma$ of $K$ if the class number of $K$ is two.
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.