2000 character limit reached
On Monochromatic Solutions of Linear Equations Using At Least Three Colors
Published 28 Jan 2025 in math.CO and math.NT | (2501.17136v3)
Abstract: We study the number of monochromatic solution to linear equation in ${1,\dots,n}$ when we color the set by at least three colors. We consider the $r$-commonness for $r\geq 3$ of linear equation with odd number of terms, and we also prove that any $2$-uncommon equation is $r$-uncommon for any $r\geq 3$.
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.