2000 character limit reached
Some Extensions of Finite Sum Theorem
Published 21 Aug 2024 in math.CO, math.DS, and math.NT | (2408.11661v1)
Abstract: The paper gives some multi-dimensional extensions of Hindman's finite sum theorem. In particular, by the method of this paper, we prove that for any finite coloring of $\mathbb N$, there are $a,b\in \mathbb N$ such that there exist (infinitely many) pairs $(x,y),(u,v)\in \mathbb N2$ such that the two sets ${ax,ay,xy,a(x+y)}$ and ${u+b,v+b,uv+b,u+v}$ are monochromatic.
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.