English

Numbers in a Beatty sequence which are orders only of cyclic, abelian or nilpotent groups

Number Theory 2026-05-05 v1

Abstract

Let C(x)C(x), A(x)A(x), and N(x)N(x) denote the counting functions of cyclic, abelian, and nilpotent numbers not exceeding xx, respectively. Their asymptotic formulas have been established in recent work by Pollack and Just. In this paper, by adapting the methods of Pollack and Just, we study the distribution of these numbers in Beatty sequences Bα,β=([αn+β])n=1\mathcal{B}_{\alpha,\beta} = ([\alpha n + \beta])_{n=1}^{\infty}, where α>1\alpha > 1 is an irrational number of finite type and β\beta is a fixed real number. We prove that the counting functions #C(x)\#C^*(x), #A(x)\#A^*(x), and #N(x)\#N^*(x) for cyclic, abelian, and nilpotent numbers in Beatty sequences satisfy asymptotic formulas that differ from those of Pollack and Just only by a factor 1/α1/\alpha.

Keywords

Cite

@article{arxiv.2605.01682,
  title  = {Numbers in a Beatty sequence which are orders only of cyclic, abelian or nilpotent groups},
  author = {Kang Shengyu},
  journal= {arXiv preprint arXiv:2605.01682},
  year   = {2026}
}