Fractional parts of generalized polynomials at prime arguments (Q6614346)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fractional parts of generalized polynomials at prime arguments |
scientific article; zbMATH DE number 7922145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fractional parts of generalized polynomials at prime arguments |
scientific article; zbMATH DE number 7922145 |
Statements
Fractional parts of generalized polynomials at prime arguments (English)
0 references
7 October 2024
0 references
Let \(f\) be a monic polynomial with real coefficients. Consider a pair \((\alpha,\beta)\) such that there exists \(t\geq 1\) satisfying the condition \N\[\N\max(1,|m|)^{t+\varepsilon}\max(1,|n|)^{t+\varepsilon}||m\alpha+n\alpha\beta||\gg_{\varepsilon} 1\N\]\Nfor any \(\varepsilon>0\) and any \((m,n)\in\mathbb{Z}^2\), \((m,n)\neq (0,0)\). Let \(\{p_n\}\) be a sequence of all prime numbers.\N\NThen there exists effectively computable \(\theta\) (depending on \(t\) and degree of \(f\) such that the discrepancy \(D_N\) of the sequence \(\{[f(p_n)\alpha]\beta\}_{2\leq p_N\leq N}\) can be bounded from above as \N\[\ND_N\ll_{\alpha,\beta,\varepsilon} N^{-\theta+\varepsilon}.\N\]\NSimilar upper bound also holds for the quantity \(\min_{2\leq p_n\leq N} ||[f(p_n)\alpha]\beta||\).
0 references
discrepancy
0 references
generalized polynomial
0 references
Vaughan's identity
0 references
0 references