arXiv Analytics

Sign in

arXiv:2107.01550 [math.CO]AbstractReferencesReviewsResources

Solution Regularity of k-partite Linear Systems -- Variant of Rado's Theorem

Hongyi Zhou

Published 2021-07-04Version 1

Ramsey theory is a modern and arresting field of mathematics with a century of history. The basic paradigm of Ramsey Theory is that any sufficiently large regular structure contains some highly ordered substructure. One number theoretic Ramseyan result is the Rado's Theorem. In this research, I extended the Rado's Theorem to a more general model. Given $k \ge 2$, there are some necessary and sufficient conditions such that for a system of linear equations to be semi-regular on $\mathbb{Z}$. In this article, I will show the proof to this extended theorem with a combination of conventional strategies (applied to prove Rado's Theorem) and new perspectives (in linear algebra and number theory). Some polynomials methods are applied here to make use of the existence of infinitely many desired prime numbers.

Comments: 18 pages (including table of contents and references)
Categories: math.CO, math.NT
Related articles: Most relevant | Search more
arXiv:1202.2581 [math.CO] (Published 2012-02-12)
Toward a graph version of Rado's theorem
arXiv:2211.15840 [math.CO] (Published 2022-11-29)
On the use of senders for asymmetric tuples of cliques in Ramsey theory
arXiv:2411.17456 [math.CO] (Published 2024-11-26)
Element-Distinct Solution For Rado's Theorem