BourbakiV1, Istex, Corpus, bibRecord, 003174

On the Number of Points of Some Hypersurfaces in F n q

Identifieur interne : 003174 ( Istex/Corpus ); précédent : 003173; suivant : 003175

On the Number of Points of Some Hypersurfaces in F n q

Auteurs : Jean Pierre Cherdieu ; Robert Rolland

Source :

Finite Fields and Their Applications [ 1071-5797 ] ; 1996.

RBID : ISTEX:F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E

English descriptors

KwdEn :
- Academic press, Common subspace, Generalized code, Generalized codes, Hyperplane, Hyperplane arrangement, Hyperplane arrangements, Hyperplane intersects, Hyperplanes, Hypersurfaces, Irreducible, Irreducible factor, Irreducible polynomial, Linear functions, Maximum number, Mobius function, Mobius functions, Other hyperplanes, Parallel hyperplanes, Polynomial function, Polynomial functions, Rolland proof, Strict inequality, Total degree, Total number.
Teeft :
- Academic press, Common subspace, Generalized code, Generalized codes, Hyperplane, Hyperplane arrangement, Hyperplane arrangements, Hyperplane intersects, Hyperplanes, Hypersurfaces, Irreducible, Irreducible factor, Irreducible polynomial, Linear functions, Maximum number, Mobius function, Mobius functions, Other hyperplanes, Parallel hyperplanes, Polynomial function, Polynomial functions, Rolland proof, Strict inequality, Total degree, Total number.

Abstract

Abstract: For generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight, that is, the weight which is just above the minimal distance, and we also list all the codewords which reach this weight. To do this we have to study the number of points of some hypersurfaces and some arrangements of hyperplanes. We also present some properties of the Möbius function of these arrangements.

Url:

https://api.istex.fr/document/F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E/fulltext/pdf

DOI: 10.1006/ffta.1996.0014

Links to Exploration step

ISTEX:F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the Number of Points of Some Hypersurfaces in F n q</title>
<author><name sortKey="Cherdieu, Jean Pierre" sort="Cherdieu, Jean Pierre" uniqKey="Cherdieu J" first="Jean Pierre" last="Cherdieu">Jean Pierre Cherdieu</name>
<affiliation><mods:affiliation>Département de Mathématiques Informatique, Université des Antilles et de la Guyane, Campus de Fouillole, F97159, Pointe-à-Pitre Cedex, France, f1 E-mail: Jean-Pierre.Cherdieu@univ-ag.frf1</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Rolland, Robert" sort="Rolland, Robert" uniqKey="Rolland R" first="Robert" last="Rolland">Robert Rolland</name>
<affiliation><mods:affiliation>C.N.R.S. Laboratoire de Mathématiques Discrètes, Luminy Case 930, F13288, Marseille Cedex 9, France, f2 E-mail: rolland@lmd.univ-mrs.frf2</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E</idno>
<date when="1996" year="1996">1996</date>
<idno type="doi">10.1006/ffta.1996.0014</idno>
<idno type="url">https://api.istex.fr/document/F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">003174</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003174</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the Number of Points of Some Hypersurfaces in F n q</title>
<author><name sortKey="Cherdieu, Jean Pierre" sort="Cherdieu, Jean Pierre" uniqKey="Cherdieu J" first="Jean Pierre" last="Cherdieu">Jean Pierre Cherdieu</name>
<affiliation><mods:affiliation>Département de Mathématiques Informatique, Université des Antilles et de la Guyane, Campus de Fouillole, F97159, Pointe-à-Pitre Cedex, France, f1 E-mail: Jean-Pierre.Cherdieu@univ-ag.frf1</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Rolland, Robert" sort="Rolland, Robert" uniqKey="Rolland R" first="Robert" last="Rolland">Robert Rolland</name>
<affiliation><mods:affiliation>C.N.R.S. Laboratoire de Mathématiques Discrètes, Luminy Case 930, F13288, Marseille Cedex 9, France, f2 E-mail: rolland@lmd.univ-mrs.frf2</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Finite Fields and Their Applications</title>
<title level="j" type="abbrev">YFFTA</title>
<idno type="ISSN">1071-5797</idno>
<imprint><publisher>ELSEVIER</publisher>
<date type="published" when="1996">1996</date>
<biblScope unit="volume">2</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="page" from="214">214</biblScope>
<biblScope unit="page" to="224">224</biblScope>
</imprint>
<idno type="ISSN">1071-5797</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">1071-5797</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Academic press</term>
<term>Common subspace</term>
<term>Generalized code</term>
<term>Generalized codes</term>
<term>Hyperplane</term>
<term>Hyperplane arrangement</term>
<term>Hyperplane arrangements</term>
<term>Hyperplane intersects</term>
<term>Hyperplanes</term>
<term>Hypersurfaces</term>
<term>Irreducible</term>
<term>Irreducible factor</term>
<term>Irreducible polynomial</term>
<term>Linear functions</term>
<term>Maximum number</term>
<term>Mobius function</term>
<term>Mobius functions</term>
<term>Other hyperplanes</term>
<term>Parallel hyperplanes</term>
<term>Polynomial function</term>
<term>Polynomial functions</term>
<term>Rolland proof</term>
<term>Strict inequality</term>
<term>Total degree</term>
<term>Total number</term>
</keywords>
<keywords scheme="Teeft" xml:lang="en"><term>Academic press</term>
<term>Common subspace</term>
<term>Generalized code</term>
<term>Generalized codes</term>
<term>Hyperplane</term>
<term>Hyperplane arrangement</term>
<term>Hyperplane arrangements</term>
<term>Hyperplane intersects</term>
<term>Hyperplanes</term>
<term>Hypersurfaces</term>
<term>Irreducible</term>
<term>Irreducible factor</term>
<term>Irreducible polynomial</term>
<term>Linear functions</term>
<term>Maximum number</term>
<term>Mobius function</term>
<term>Mobius functions</term>
<term>Other hyperplanes</term>
<term>Parallel hyperplanes</term>
<term>Polynomial function</term>
<term>Polynomial functions</term>
<term>Rolland proof</term>
<term>Strict inequality</term>
<term>Total degree</term>
<term>Total number</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: For generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight, that is, the weight which is just above the minimal distance, and we also list all the codewords which reach this weight. To do this we have to study the number of points of some hypersurfaces and some arrangements of hyperplanes. We also present some properties of the Möbius function of these arrangements.</div>
</front>
</TEI>
<istex><corpusName>elsevier</corpusName>
<keywords><teeft><json:string>hyperplanes</json:string>
<json:string>hyperplane</json:string>
<json:string>polynomial functions</json:string>
<json:string>irreducible</json:string>
<json:string>hypersurfaces</json:string>
<json:string>linear functions</json:string>
<json:string>irreducible polynomial</json:string>
<json:string>hyperplane arrangement</json:string>
<json:string>total degree</json:string>
<json:string>polynomial function</json:string>
<json:string>irreducible factor</json:string>
<json:string>generalized codes</json:string>
<json:string>hyperplane intersects</json:string>
<json:string>total number</json:string>
<json:string>mobius function</json:string>
<json:string>other hyperplanes</json:string>
<json:string>academic press</json:string>
<json:string>maximum number</json:string>
<json:string>generalized code</json:string>
<json:string>parallel hyperplanes</json:string>
<json:string>rolland proof</json:string>
<json:string>strict inequality</json:string>
<json:string>mobius functions</json:string>
<json:string>common subspace</json:string>
<json:string>hyperplane arrangements</json:string>
</teeft>
</keywords>
<author><json:item><name>Jean Pierre Cherdieu</name>
<affiliations><json:string>Département de Mathématiques Informatique, Université des Antilles et de la Guyane, Campus de Fouillole, F97159, Pointe-à-Pitre Cedex, France, f1 E-mail: Jean-Pierre.Cherdieu@univ-ag.frf1</json:string>
</affiliations>
</json:item>
<json:item><name>Robert Rolland</name>
<affiliations><json:string>C.N.R.S. Laboratoire de Mathématiques Discrètes, Luminy Case 930, F13288, Marseille Cedex 9, France, f2 E-mail: rolland@lmd.univ-mrs.frf2</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/6H6-RBW06MBS-F</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>Full-length article</json:string>
</originalGenre>
<abstract>Abstract: For generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight, that is, the weight which is just above the minimal distance, and we also list all the codewords which reach this weight. To do this we have to study the number of points of some hypersurfaces and some arrangements of hyperplanes. We also present some properties of the Möbius function of these arrangements.</abstract>
<qualityIndicators><score>5.777</score>
<pdfWordCount>2973</pdfWordCount>
<pdfCharCount>13182</pdfCharCount>
<pdfVersion>1.1</pdfVersion>
<pdfPageCount>11</pdfPageCount>
<pdfPageSize>359 x 570 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<abstractWordCount>67</abstractWordCount>
<abstractCharCount>411</abstractCharCount>
<keywordCount>0</keywordCount>
</qualityIndicators>
<title>On the Number of Points of Some Hypersurfaces in F n q</title>
<pii><json:string>S1071-5797(96)90014-3</json:string>
</pii>
<genre><json:string>research-article</json:string>
</genre>
<host><title>Finite Fields and Their Applications</title>
<language><json:string>unknown</json:string>
</language>
<publicationDate>1996</publicationDate>
<issn><json:string>1071-5797</json:string>
</issn>
<pii><json:string>S1071-5797(00)X0020-2</json:string>
</pii>
<volume>2</volume>
<issue>2</issue>
<pages><first>214</first>
<last>224</last>
</pages>
<genre><json:string>journal</json:string>
</genre>
</host>
<namedEntities><unitex><date><json:string>1996</json:string>
</date>
<geogName></geogName>
<orgName><json:string>Academic Press, Inc.</json:string>
</orgName>
<orgName_funder></orgName_funder>
<orgName_provider></orgName_provider>
<persName><json:string>ROLLAND Proof</json:string>
</persName>
<placeName></placeName>
<ref_url></ref_url>
<ref_bibl><json:string>[4]</json:string>
<json:string>[6]</json:string>
<json:string>Kasami et al.</json:string>
<json:string>Delsarte et al.</json:string>
<json:string>[3]</json:string>
<json:string>[9]</json:string>
<json:string>[2]</json:string>
</ref_bibl>
<bibl></bibl>
</unitex>
</namedEntities>
<ark><json:string>ark:/67375/6H6-RBW06MBS-F</json:string>
</ark>
<categories><wos><json:string>1 - science</json:string>
<json:string>2 - mathematics, applied</json:string>
<json:string>2 - mathematics</json:string>
</wos>
<scienceMetrix><json:string>1 - natural sciences</json:string>
<json:string>2 - mathematics & statistics</json:string>
<json:string>3 - general mathematics</json:string>
</scienceMetrix>
<scopus><json:string>1 - Physical Sciences</json:string>
<json:string>2 - Mathematics</json:string>
<json:string>3 - Applied Mathematics</json:string>
<json:string>1 - Physical Sciences</json:string>
<json:string>2 - Engineering</json:string>
<json:string>3 - General Engineering</json:string>
<json:string>1 - Physical Sciences</json:string>
<json:string>2 - Mathematics</json:string>
<json:string>3 - Algebra and Number Theory</json:string>
<json:string>1 - Physical Sciences</json:string>
<json:string>2 - Mathematics</json:string>
<json:string>3 - Theoretical Computer Science</json:string>
</scopus>
<inist><json:string>1 - sciences appliquees, technologies et medecines</json:string>
<json:string>2 - sciences biologiques et medicales</json:string>
<json:string>3 - sciences medicales</json:string>
</inist>
</categories>
<publicationDate>1996</publicationDate>
<copyrightDate>1996</copyrightDate>
<doi><json:string>10.1006/ffta.1996.0014</json:string>
</doi>
<id>F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E/fulltext/pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">On the Number of Points of Some Hypersurfaces in F n q</title>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher>ELSEVIER</publisher>
<availability><p>©1996 Academic Press</p>
</availability>
<date>1996</date>
</publicationStmt>
<notesStmt><note type="content">Section title: Regular Article</note>
</notesStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">On the Number of Points of Some Hypersurfaces in F n q</title>
<author xml:id="author-0000"><persName><forename type="first">Jean Pierre</forename>
<surname>Cherdieu</surname>
</persName>
<email>Jean-Pierre.Cherdieu@univ-ag.frf1</email>
</author>
<author xml:id="author-0001"><persName><forename type="first">Robert</forename>
<surname>Rolland</surname>
</persName>
<email>rolland@lmd.univ-mrs.frf2</email>
</author>
<idno type="istex">F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E</idno>
<idno type="DOI">10.1006/ffta.1996.0014</idno>
<idno type="PII">S1071-5797(96)90014-3</idno>
</analytic>
<monogr><title level="j">Finite Fields and Their Applications</title>
<title level="j" type="abbrev">YFFTA</title>
<idno type="pISSN">1071-5797</idno>
<idno type="PII">S1071-5797(00)X0020-2</idno>
<imprint><publisher>ELSEVIER</publisher>
<date type="published" when="1996"></date>
<biblScope unit="volume">2</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="page" from="214">214</biblScope>
<biblScope unit="page" to="224">224</biblScope>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>1996</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>For generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight, that is, the weight which is just above the minimal distance, and we also list all the codewords which reach this weight. To do this we have to study the number of points of some hypersurfaces and some arrangements of hyperplanes. We also present some properties of the Möbius function of these arrangements.</p>
</abstract>
</profileDesc>
<revisionDesc><change when="1995-07-17">Modified</change>
<change when="1996">Published</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-10-1">References added</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/document/F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="Elsevier converted-article found"><istex:xmlDeclaration>version="1.0" encoding="utf-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//ES//DTD journal article DTD version 4.5.2//EN//XML" URI="art452.dtd" name="istex:docType"></istex:docType>
<istex:document><converted-article version="4.5.2" docsubtype="fla" xml:lang="en"><item-info><jid>YFFTA</jid>
<aid>90014</aid>
<ce:pii>S1071-5797(96)90014-3</ce:pii>
<ce:doi>10.1006/ffta.1996.0014</ce:doi>
<ce:copyright type="full-transfer" year="1996">Academic Press</ce:copyright>
</item-info>
<head><ce:dochead><ce:textfn>Regular Article</ce:textfn>
</ce:dochead>
<ce:title>On the Number of Points of Some Hypersurfaces in <math altimg="si1.gif"><of>F</of>
</math>
<ce:sup><ce:italic>n</ce:italic>
</ce:sup>
<ce:inf><ce:italic>q</ce:italic>
</ce:inf>
</ce:title>
<ce:author-group><ce:author><ce:given-name>Jean Pierre</ce:given-name>
<ce:surname>Cherdieu</ce:surname>
<ce:cross-ref refid="A0"><ce:sup>a</ce:sup>
</ce:cross-ref>
</ce:author>
<ce:author><ce:given-name>Robert</ce:given-name>
<ce:surname>Rolland</ce:surname>
<ce:cross-ref refid="A1"><ce:sup>b</ce:sup>
</ce:cross-ref>
</ce:author>
<ce:affiliation id="A0"><ce:label>a</ce:label>
<ce:textfn>Département de Mathématiques Informatique, Université des Antilles et de la Guyane, Campus de Fouillole, F97159, Pointe-à-Pitre Cedex, France, <ce:footnote id="F1"><ce:label>f1</ce:label>
<ce:note-para>E-mail: Jean-Pierre.Cherdieu@univ-ag.fr</ce:note-para>
</ce:footnote>
<ce:cross-ref refid="F1"><ce:sup>f1</ce:sup>
</ce:cross-ref>
</ce:textfn>
</ce:affiliation>
<ce:affiliation id="A1"><ce:label>b</ce:label>
<ce:textfn>C.N.R.S. Laboratoire de Mathématiques Discrètes, Luminy Case 930, F13288, Marseille Cedex 9, France, <ce:footnote id="F2"><ce:label>f2</ce:label>
<ce:note-para>E-mail: rolland@lmd.univ-mrs.fr</ce:note-para>
</ce:footnote>
<ce:cross-ref refid="F2"><ce:sup>f2</ce:sup>
</ce:cross-ref>
</ce:textfn>
</ce:affiliation>
</ce:author-group>
<ce:date-received day="15" month="11" year="1994"></ce:date-received>
<ce:date-revised day="17" month="7" year="1995"></ce:date-revised>
<ce:abstract><ce:section-title>Abstract</ce:section-title>
<ce:abstract-sec><ce:simple-para>For generalized Reed–Muller codes, when<ce:italic>q</ce:italic>
is large enough, we give the second codeword weight, that is, the weight which is just above the minimal distance, and we also list all the codewords which reach this weight. To do this we have to study the number of points of some hypersurfaces and some arrangements of hyperplanes. We also present some properties of the Möbius function of these arrangements.</ce:simple-para>
</ce:abstract-sec>
</ce:abstract>
</head>
</converted-article>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>On the Number of Points of Some Hypersurfaces in F n q</title>
</titleInfo>
<titleInfo type="alternative" lang="en" contentType="CDATA"><title>On the Number of Points of Some Hypersurfaces in</title>
</titleInfo>
<name type="personal"><namePart type="given">Jean Pierre</namePart>
<namePart type="family">Cherdieu</namePart>
<affiliation>Département de Mathématiques Informatique, Université des Antilles et de la Guyane, Campus de Fouillole, F97159, Pointe-à-Pitre Cedex, France, f1 E-mail: Jean-Pierre.Cherdieu@univ-ag.frf1</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Robert</namePart>
<namePart type="family">Rolland</namePart>
<affiliation>C.N.R.S. Laboratoire de Mathématiques Discrètes, Luminy Case 930, F13288, Marseille Cedex 9, France, f2 E-mail: rolland@lmd.univ-mrs.frf2</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="research-article" displayLabel="Full-length article" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-1JC4F85T-7">research-article</genre>
<originInfo><publisher>ELSEVIER</publisher>
<dateIssued encoding="w3cdtf">1996</dateIssued>
<dateModified encoding="w3cdtf">1995-07-17</dateModified>
<copyrightDate encoding="w3cdtf">1996</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="iso639-2b">eng</languageTerm>
<languageTerm type="code" authority="rfc3066">en</languageTerm>
</language>
<abstract lang="en">Abstract: For generalized Reed–Muller codes, whenqis large enough, we give the second codeword weight, that is, the weight which is just above the minimal distance, and we also list all the codewords which reach this weight. To do this we have to study the number of points of some hypersurfaces and some arrangements of hyperplanes. We also present some properties of the Möbius function of these arrangements.</abstract>
<note type="content">Section title: Regular Article</note>
<relatedItem type="host"><titleInfo><title>Finite Fields and Their Applications</title>
</titleInfo>
<titleInfo type="abbreviated"><title>YFFTA</title>
</titleInfo>
<genre type="journal" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0GLKJH51-B">journal</genre>
<originInfo><publisher>ELSEVIER</publisher>
<dateIssued encoding="w3cdtf">199604</dateIssued>
</originInfo>
<identifier type="ISSN">1071-5797</identifier>
<identifier type="PII">S1071-5797(00)X0020-2</identifier>
<part><date>199604</date>
<detail type="volume"><number>2</number>
<caption>vol.</caption>
</detail>
<detail type="issue"><number>2</number>
<caption>no.</caption>
</detail>
<extent unit="issue-pages"><start>125</start>
<end>224</end>
</extent>
<extent unit="pages"><start>214</start>
<end>224</end>
</extent>
</part>
</relatedItem>
<identifier type="istex">F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E</identifier>
<identifier type="ark">ark:/67375/6H6-RBW06MBS-F</identifier>
<identifier type="DOI">10.1006/ffta.1996.0014</identifier>
<identifier type="PII">S1071-5797(96)90014-3</identifier>
<accessCondition type="use and reproduction" contentType="copyright">©1996 Academic Press</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-HKKZVM7B-M">elsevier</recordContentSource>
<recordOrigin>Academic Press, ©1996</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/document/F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E/metadata/json</uri>
</json:item>
</metadata>
<serie></serie>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Mathematiques/explor/BourbakiV1/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003174 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003174 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Mathematiques
   |area=    BourbakiV1
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:F2EB826A7E2F2BA590B9CB8C07C883F08D0D433E
   |texte=   On the Number of Points of Some Hypersurfaces in F n q
}}

This area was generated with Dilib version V0.6.33.
Data generation: Thu Jul 5 10:00:31 2018. Site generation: Sat Nov 19 17:42:07 2022

	Serveur d'exploration Bourbaki
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration Bourbaki

On the Number of Points of Some Hypersurfaces in F n q

On the Number of Points of Some Hypersurfaces in F n q

Source :

English descriptors

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri