<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>The polynomial sieve and equal sums of like polynomials</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Timothy D</namePart>
  <namePart type="family">Browning</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">35827D50-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-8314-0177</description></name>














<abstract lang="eng">A new &amp;quot;polynomial sieve&amp;quot; is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.</abstract>

<originInfo><publisher>Oxford University Press</publisher><dateIssued encoding="w3cdtf">2014</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>International Mathematics Research Notices</title></titleInfo><identifier type="doi">10.1093/imrn/rnt350</identifier>
<part><detail type="volume"><number>2015</number></detail><detail type="issue"><number>7</number></detail><extent unit="pages">1987 - 2019</extent>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/19051</url>  </location>
</relatedItem>

<relatedItem type="Supplementary material">
  <location>
  
     <url>https://doi.org/10.1093/imrn/rnae066</url>
  
  </location>
</relatedItem>
<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<ieee>T. D. Browning, “The polynomial sieve and equal sums of like polynomials,” &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;, vol. 2015, no. 7. Oxford University Press, pp. 1987–2019, 2014.</ieee>
<ama>Browning TD. The polynomial sieve and equal sums of like polynomials. &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;. 2014;2015(7):1987-2019. doi:&lt;a href=&quot;https://doi.org/10.1093/imrn/rnt350&quot;&gt;10.1093/imrn/rnt350&lt;/a&gt;</ama>
<ista>Browning TD. 2014. The polynomial sieve and equal sums of like polynomials. International Mathematics Research Notices. 2015(7), 1987–2019.</ista>
<chicago>Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.” &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;. Oxford University Press, 2014. &lt;a href=&quot;https://doi.org/10.1093/imrn/rnt350&quot;&gt;https://doi.org/10.1093/imrn/rnt350&lt;/a&gt;.</chicago>
<apa>Browning, T. D. (2014). The polynomial sieve and equal sums of like polynomials. &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;. Oxford University Press. &lt;a href=&quot;https://doi.org/10.1093/imrn/rnt350&quot;&gt;https://doi.org/10.1093/imrn/rnt350&lt;/a&gt;</apa>
<short>T.D. Browning, International Mathematics Research Notices 2015 (2014) 1987–2019.</short>
<mla>Browning, Timothy D. “The Polynomial Sieve and Equal Sums of like Polynomials.” &lt;i&gt;International Mathematics Research Notices&lt;/i&gt;, vol. 2015, no. 7, Oxford University Press, 2014, pp. 1987–2019, doi:&lt;a href=&quot;https://doi.org/10.1093/imrn/rnt350&quot;&gt;10.1093/imrn/rnt350&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>254</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:45:27Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-09T12:16:44Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
