Evaluation of polynomials over finite rings via additive combinatorics

• Autores: Gyula Károlyi, Csaba Szabó
• Localización: Publicacions matematiques, ISSN 0214-1493, Vol. 66, Nº 1, 2022, págs. 197-205
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics, whichmay be of independent interest.