2000 character limit reached
Element-Distinct Solution For Rado's Theorem
Published 26 Nov 2024 in math.CO | (2411.17456v2)
Abstract: In this paper, we present a simplified proof of Rado's Theorem and demonstrate that when an integer matrix $M$ satisfies the column condition and $M\mathbf x=\mathbf 0$ has an element-distinct solution on $\mathbb N$, then under any finite coloring of $\mathbb N$, the equation $M\mathbf x=\mathbf 0$ has a monochromatic element-distinct solution. This gives a positive answer to a problem of Di Nasso in 2016.
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.