Multiplicative energy of polynomial images of intervals modulo q

• Kyle Castro ^[1] ; Mei-Chu Chang ^[1]
  1. [1] University of California
• Localización: Revista matemática iberoamericana, ISSN 0213-2230, Vol. 34, Nº 3, 2018, págs. 1093-1101
• Idioma: inglés
• DOI: 10.4171/RMI/1017
• Texto completo no disponible (Saber más ...)
• Resumen

  • Given a smooth integer q, we use existing upper bounds for character sums to find a lower bound for the size of a multiplicative subgroup of the integers modulo q which contains the image of an interval of consecutive integers I⊂Zq under a polynomial f∈Z[X].