<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T20:21:08Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6406" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6406</identifier><datestamp>2017-03-21T17:25:18Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9932</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="1d621295-df92-42e8-9ec0-49c0ceb43fa2" confidence="600">Nishizawa, Yui</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2011-12-19T17:22:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2011-12-19T17:22:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2011-12-19T17:22:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2011-12-06</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6406</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">For any finite set B and a subset A⊆B, we define the density of A in B to be the value α=|A|/|B|. Roth&amp;apos;s famous theorem, proven in 1953, states that there is a constant C&amp;gt;0, such that if A⊆{1,...,N} for a positive integer N and A has density α in {1,...,N} with α&amp;gt;C/loglog N, then A contains a non-trivial arithmetic progression of length three (3AP). The proof of this relies on the following dichotomy: either 1) A looks like a random set and the number of 3APs in A is close to the probabilistic expected value, or 2) A is more structured and consequently, there is a progression P of about length α√N on which A∩P has α(1+cα) for some c&amp;gt;0. If 1) occurs, then we are done. If 2) occurs, then we identify P with {1,...,|P|} and repeat the above argument, whereby the density increases at each iteration of the dichotomy. Due to the density increase in case 2), an argument of this type is called a density increment argument. The density increment is obtained by studying the Fourier transforms of the characterstic function of A and extracting a structure out of A. Improving the lower bound for α is still an active area of research and all improvements so far employ a density increment.  Two of the most recent results are α&amp;gt;C(loglog N/log N)^{1/2} by Bourgain in 1999 and α&amp;gt;C(loglog N)^5/log N by Sanders in 2010. This thesis is a survey of progresses in Roth&amp;apos;s theorem, with a focus on these last two results. Attention was given to unifying the language in which the results are discussed and simplifying the presentation.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Number theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Additive combinatorics</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Pure Mathematics</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">A survey of Roth&amp;apos;s Theorem on progressions of length three</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Pure Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>