Roth 定理闡述了如果一個正整數的子集的"密度"大於0,則它包含一個長度為3的等差數列。在本篇論文,我們探討了傅氏分析在組合學上的一些運用。除此之外,利用一些基本數論的結果,我們了解如何使用傅氏分析來證明Roth 定理。 ;The celebrated result of Roth asserts that there exists an arithmetic progression of length three in a subset in integers with positive upper density. The result has been reproved and generalized later by many people. In this thesis, we study the approaches of Fourier analysis methods. We will see that the Finite Fourier analysis is powerful enough to prove the Roth theorem.
