Character sums with smooth numbers (Q1749379): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: SMOOTH‐SUPPORTED MULTIPLICATIVE FUNCTIONS IN ARITHMETIC PROGRESSIONS BEYOND THE ‐BARRIER / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTEGERS FREE OF LARGE PRIME DIVISORS IN SHORT INTERVALS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Integers Free of Large Prime Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large values of Dirichlet polynomials, III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linnik's constant. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4652415 / rank
 
Normal rank

Revision as of 15:03, 15 July 2024

scientific article
Language Label Description Also known as
English
Character sums with smooth numbers
scientific article

    Statements

    Character sums with smooth numbers (English)
    0 references
    16 May 2018
    0 references
    \textit{S. Drappeau} et al. [Mathematika 63, No. 3, 895--918 (2017; Zbl 1428.11174)] proved a bound on the frequency of pairs \((q,\chi)\) of moduli \(q\) and primitive characters \(\chi\) modulo \(q\), for which the corresponding character sums over smooth numbers and weighted by some bounded weights \((a_n)\) are large. By using a better decomposition and some uniformity, the author improves on this bound. He also reports on a simpler approach due to \textit{A.J. Harper} [``Bombieri-Vinogradov and Barban-Davenport-Halberstam type theorems for smooth numbers'', Preprint, \url{arXiv:1208.5992 }] in the case \(a_n=1\).
    0 references
    character sum
    0 references
    smooth number
    0 references
    large sieve
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references