2000 character limit reached
Partition regularity for systems of diagonal equations
Published 24 Mar 2020 in math.NT and math.CO | (2003.10977v1)
Abstract: We consider systems of $n$ diagonal equations in $k$th powers. Our main result shows that if the coefficient matrix of such a system is sufficiently non-singular, then the system is partition regular if and only if it satisfies Rado's columns condition. Furthermore, if the system also admits constant solutions, then we prove that the system has non-trivial solutions over every set of integers of positive upper density.
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.