Counting multiplicative groups with prescribed subgroups

preprint2020arXivOpen access

Abstract

We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime qq and a finite abelian qq-group HH, we consider the set of integers n≤xn\le x such that the Sylow qq-subgroup of the multiplicative group (Z/nZ)×(\mathbb Z/n\mathbb Z)^\times is isomorphic to HH. We show that the counting function of this set of integers is asymptotic to Kx(log⁡log⁡x)ℓ/(log⁡x)1/(q−1)K x(\log\log x)^\ell/(\log x)^{1/(q-1)} for explicit constants KK and ℓ\ell depending on qq and HH. Second, we consider the set of integers n≤xn\le x such that the multiplicative group (Z/nZ)×(\mathbb Z/n\mathbb Z)^\times is "maximally non-cyclic", that is, such that all of its prime-power subgroups are elementary groups. We show that the counting function of this set of integers is asymptotic to Ax/(log⁡x)1−ξA x/(\log x)^{1-ξ} for an explicit constant AA, where ξξ is Artin's constant. As it turns out, both of these group-theoretic problems can be reduced to problems of counting integers with restrictions on their prime factors, allowing them to be addressed by classical techniques of analytic number theory.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.