Abstract

In this paper, we bound the number of solutions to a general Vinogradov system of equations [Formula: see text] as well as other related systems, in which the variables are required to satisfy digital restrictions in a given base. Specifically, our sets of permitted digits have the property that there are few representations of a natural number as sums of elements of the digit set — the set of squares serving as a key example. We obtain better bounds using this additive structure than could be deduced purely from the size of the set of variables. In particular, when the digits are required to be squares, we obtain diagonal behavior with [Formula: see text] variables.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.