<?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-22T13:04:48Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6432" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6432</identifier><datestamp>2017-03-21T20:14:29Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</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="86ddfb03-f02a-4bed-bf54-262622de672c" confidence="600">Leong, Alexander</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-01-04T20:13:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-01-04T20:13:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2012-01-04T20:13:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2011</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6432</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The Erdős discrepancy problem asks, &amp;quot;Does there exist a sequence t = {t_i}_{1≤i&amp;lt;∞} with each t_i ∈ {-1,1} and a constant c such that |∑_{1≤i≤n} t_{id}| ≤ c for all n,c ∈ ℕ = {1,2,3,...}?&amp;quot;  The discrepancy of t equals sup_{n≥1} |∑_{1≤i≤n} t_{id}|. Erdős conjectured in 1957 that no such sequence exists.&#xd;
&#xd;
We examine versions of this problem with  fixed values for c and where the values of d are restricted to particular subsets of ℕ. By examining a wide variety of different subsets, we hope to learn more about the original problem.  When the values of d are restricted to the set {1,2,4,8,...}, we show that there are exactly two infinite {-1,1} sequences with discrepancy bounded by 1 and an uncountable number of in nite {-1,1} sequences with discrepancy bounded by 2.  We also show that the number of {-1,1} sequences of length n with discrepancy bounded by 1 is 2^{s2(n)} where s2(n) is the number of 1s in the binary representation of n.&#xd;
&#xd;
When the values of d are restricted to the set {1,b,b^2,b^3,...} for b &amp;gt; 2, we show there are an uncountable number of infinite sequences with discrepancy bounded by 1.  We also give a recurrence for the number of sequences of length n with discrepancy bounded by 1. When the values of d are restricted to the set {1,3,5,7,..} we conjecture that there are exactly 4 in finite sequences with discrepancy bounded by 1 and give some experimental evidence for this conjecture.  &#xd;
&#xd;
We give descriptions of the lexicographically least sequences with D-discrepancy c for certain values of D and c as fixed points of morphisms followed by codings.  These descriptions demonstrate that these automatic sequences.&#xd;
&#xd;
We introduce the notion of discrepancy-1 maximality and prove that {1,2,4,8,...} and {1,3,5,7,...} are discrepancy-1 maximal while {1,b,b^2,...} is not for b &amp;gt; 2.  We conclude with some open questions and directions for future work.</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">automatic sequences</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">number theory</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Variations on the Erdos Discrepancy Problem</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">School of Computer Science</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>