Skip to main content
Logo image

Applied Combinatorics

Section 16.6 Arithmetic Combinatorics

In recent years, a great deal of attention has been focused on topics in arithmetic combinatorics, with a number of deep and exciting discoveries in the offing. In some sense, this area is closely aligned with Ramsey theory and number theory, but recent work shows connections with real and complex analysis, as well. Furthermore, the roots of arithmetic combinatorics go back many years. In this section, we present a brief overview of this rich and rapidly changing area.
Recall that an increasing sequence \(a_1\lt a_2\lt a_3\lt \dots\lt a_t)\) of integers is called an arithmetic progression when there exists a positive integer \(d\) for which \(a_{i+1}-a_i=d\text{,}\) for all \(i=1,2,\dots,t-1\text{.}\) The integer \(t\) is called the length of the arithmetic progression.
Material will be added here.