Discrepancy of fractions with divisibility constraints (Q857853)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Discrepancy of fractions with divisibility constraints
scientific article

    Statements

    Discrepancy of fractions with divisibility constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 January 2007
    0 references
    Let \(\mathcal{F}_Q=\{\gamma_i; i=1,2,\ldots, N(Q)\}\) denote the Farey sequence of order \(Q\) and arrage its elements in increasing order of magnitude, \(1/Q=\gamma_1<\gamma_2<\cdots <\gamma_{N(Q)}=1\). For any \(Q\geq 1\) and \(\alpha\in [0,1]\), let \(A(\alpha ;N(Q))\) be the number of Farey fractions that do not exceed \(\alpha\). Then the absolute discrepancy of \(\mathcal{F}_Q\) is given by \[ D_{N(Q)}(\mathcal{F}_Q)=\sup_{0\leq \alpha \leq 1} |A(\alpha;N(Q))/N(Q)-\alpha|. \] Given a sequence \(\mathcal{B}\) of positive integers \(1<b_1<b_2<\cdots\) such that \(\sum_{k=1}^\infty 1/b_k<\infty\) with \(\gcd(b_k,b_j)=1\) for \(k\neq j\), a number \(n\) is called \(\mathcal{B}\)-free provided that no element \(b_k\) of \(\mathcal{B}\) divides \(n\). For \(Q\geq 1\) and \(k\), \(u\geq 1\) the authors consider \[ \mathcal{F}_{Q,u,k,\mathcal{B}}=\left\{\frac aq \in \mathcal{F}_Q; q \equiv u\pmod k,\;q \text{ is } \mathcal{B}\text{-free}\right\} \] and examine the absolute discrepancy \(D_{N_{Q,u,k,\mathcal{B}}}(\mathcal{F}_{Q,u,k,\mathcal{B}})\). The main result of the authors is that for an arithmetic progression \(q \equiv u\pmod k\) with \(\gcd(k,u)=1\) and a set \(\mathcal{B}\) of prime numbers such that \(\sum_{p\in \mathcal{B}}1/p^{\sigma}<\infty\) for some \(\sigma<1\), the estimate \(D_{N_{Q,u,k,\mathcal{B}}}(\mathcal{F}_{Q,u,k,\mathcal{B}})\asymp 1/Q\) holds for all \(Q\geq 1\), where the implied constants depend on \(k\) and \(\mathcal{B}\) only.
    0 references
    0 references

    Identifiers