<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-09-21T00:03:26Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/86812" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/86812</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_16340</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_16339</setSpec>
        <setSpec>com_2142_8903</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Aimo Hinkkanen</dc:contributor>
          <dc:creator>Kim, Dong-Il</dc:creator>
          <dc:date>2015-09-28T15:19:39Z</dc:date>
          <dc:date>2015-09-28T15:19:39Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2003</dc:date>
          <dc:date>2003</dc:date>
          <dc:description>Waring's problem is about representing any function in a class of functions as a sum of kth powers of nonconstant functions in the same class. We allow complex coefficients in these kind of problems. Consider   i=1p1 fiz k=z  and   i=1p1 fizk =1 . For a given k &amp;ge; 2, let p 1 and p2 be the smallest numbers of functions that give the above identities. W. K. Hayman obtained lower bounds of  p1 and p2 for polynomials, entire functions, rational functions and meromorphic functions. First, we consider Waring's problem for linear polynomials and get p 1 = k and p2 &amp;ge;  k + 1. Next, we study Waring's problem for Laurent polynomials and obtain lower bounds of p1 and p 2. Finally, we discuss the misquote that I discovered in the proof of Hayman's theorem.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-28T15:19:39Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3086095.pdf: 1883591 bytes, checksum: 50a60b280531d3b94a80505beecbca97 (MD5)
  Previous issue date: 2003</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 88093
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>52 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/86812</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3086095</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Mathematics</dc:subject>
          <dc:title>Waring's Problem for Linear Polynomials and Laurent Polynomials</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Mathematics</department>
            <discipline>Mathematics</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
