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

Abstract

Let \(C(x)\), \(A(x)\), and \(N(x)\) denote the counting functions of cyclic, abelian, and nilpotent numbers not exceeding \(x\), 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∞\), where \(α > 1\) is an irrational number of finite type and \(β\) is a fixed real number. We prove that the counting functions \(\#C*(x)\), \(\#A*(x)\), and \(\#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/α\).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…