<?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>Counting rational points on hypersurfaces</title></titleInfo>


<note type="publicationStatus">published</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>
<name type="personal">
  <namePart type="given">Roger</namePart>
  <namePart type="family">Heath Brown</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>














<abstract lang="eng">For any n ≧ 2, let F ∈ ℤ [ x 1, … , xn ] be a form of degree d≧ 2, which produces a geometrically irreducible hypersurface in ℙn–1. This paper is concerned with the number N(F;B) of rational points on F = 0 which have height at most B. For any ε &amp;gt; 0 we establish the estimate N(F; B) = O(B n− 2+ ε ), whenever either n ≦ 5 or the hypersurface is not a union of lines. Here the implied constant depends at most upon d, n and ε.</abstract>

<originInfo><publisher>Walter de Gruyter and Co </publisher><dateIssued encoding="w3cdtf">2005</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Journal fur die Reine und Angewandte Mathematik</title></titleInfo>
  <identifier type="issn">0075-4102</identifier>
  <identifier type="arXiv">abs/math/0404456</identifier><identifier type="doi">https://doi.org/10.1515/crll.2005.2005.584.83</identifier>
<part><detail type="issue"><number>584</number></detail><extent unit="pages">83 - 115</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<short>T.D. Browning, R. Heath Brown, Journal Fur Die Reine Und Angewandte Mathematik (2005) 83–115.</short>
<ama>Browning TD, Heath Brown R. Counting rational points on hypersurfaces. &lt;i&gt;Journal fur die Reine und Angewandte Mathematik&lt;/i&gt;. 2005;(584):83-115. doi:&lt;a href=&quot;https://doi.org/10.1515/crll.2005.2005.584.83&quot;&gt;https://doi.org/10.1515/crll.2005.2005.584.83&lt;/a&gt;</ama>
<chicago>Browning, Timothy D, and Roger Heath Brown. “Counting Rational Points on Hypersurfaces.” &lt;i&gt;Journal Fur Die Reine Und Angewandte Mathematik&lt;/i&gt;. Walter de Gruyter and Co , 2005. &lt;a href=&quot;https://doi.org/10.1515/crll.2005.2005.584.83&quot;&gt;https://doi.org/10.1515/crll.2005.2005.584.83&lt;/a&gt;.</chicago>
<ieee>T. D. Browning and R. Heath Brown, “Counting rational points on hypersurfaces,” &lt;i&gt;Journal fur die Reine und Angewandte Mathematik&lt;/i&gt;, no. 584. Walter de Gruyter and Co , pp. 83–115, 2005.</ieee>
<ista>Browning TD, Heath Brown R. 2005. Counting rational points on hypersurfaces. Journal fur die Reine und Angewandte Mathematik. (584), 83–115.</ista>
<apa>Browning, T. D., &amp;#38; Heath Brown, R. (2005). Counting rational points on hypersurfaces. &lt;i&gt;Journal Fur Die Reine Und Angewandte Mathematik&lt;/i&gt;. Walter de Gruyter and Co . &lt;a href=&quot;https://doi.org/10.1515/crll.2005.2005.584.83&quot;&gt;https://doi.org/10.1515/crll.2005.2005.584.83&lt;/a&gt;</apa>
<mla>Browning, Timothy D., and Roger Heath Brown. “Counting Rational Points on Hypersurfaces.” &lt;i&gt;Journal Fur Die Reine Und Angewandte Mathematik&lt;/i&gt;, no. 584, Walter de Gruyter and Co , 2005, pp. 83–115, doi:&lt;a href=&quot;https://doi.org/10.1515/crll.2005.2005.584.83&quot;&gt;https://doi.org/10.1515/crll.2005.2005.584.83&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>212</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T11:45:14Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-08-21T09:31:08Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
