2000 character limit reached
On integer solutions of Parsell-Vinogradov systems
Published 7 Apr 2018 in math.NT and math.CA | (1804.02488v1)
Abstract: We prove a sharp upper bound on the number of integer solutions of the Parsell-Vinogradov system in every dimension $d\ge 2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.