<?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-22T10:44:16Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/7205" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/7205</identifier><datestamp>2017-03-21T21:36:55Z</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="9ee382a5-d72d-46ba-bcea-3541cd5eb6ed" confidence="600">Caley, Timothy</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-01-15T20:24:50Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-01-15T20:24:50Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2013-01-15T20:24:50Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2012</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/7205</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Given natural numbers n and k, with n&amp;gt;k, the&#xd;
Prouhet-Tarry-Escott (PTE) problem asks for distinct&#xd;
subsets of Z, say X={x_1,...,x_n} and&#xd;
Y={y_1,...,y_n}, such that&#xd;
x_1^i+...+x_n^i=y_1^i+...+y_n^i\] for i=1,...,k. Many&#xd;
partial solutions to this problem were found in the late&#xd;
19th century and early 20th century.&#xd;
&#xd;
When k=n-1, we call a solution X=(n-1)Y ideal. This is&#xd;
considered to be the most interesting case. Ideal solutions have been found using elementary methods, elliptic curves,&#xd;
and computational techniques. &#xd;
&#xd;
This thesis focuses on the ideal case. We extend the framework of the problem to number fields, &#xd;
 and prove generalizations of results from the literature. This information is used along with computational techniques to find ideal solutions to the PTE problem in the Gaussian integers.&#xd;
&#xd;
We also extend a computation from the literature and find new lower bounds for the constant C_n associated to ideal  PTE solutions. Further, we present a new algorithm that determines whether an ideal PTE solution with a particular constant exists. This algorithm improves the upper bounds for C_n and in fact, completely determines the value of C_6.&#xd;
&#xd;
We also examine the connection between elliptic curves and ideal PTE solutions. We use quadratic twists of curves that appear in the literature to find ideal PTE solutions over number fields.</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">Diophantine equations</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Tarry-Escott</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Pure Mathematics</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">The Prouhet-Tarry-Escott problem</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral 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">Doctor of Philosophy</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>