@prefix psr: <http://data.loterre.fr/ark:/67375/PSR> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix dc: <http://purl.org/dc/terms/> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

psr: a skos:ConceptScheme .
psr:-QLDS0DFZ-H
  skos:prefLabel "Dyson conjecture"@en, "conjecture de Dyson"@fr ;
  a skos:Concept ;
  skos:related psr:-S0DPGMTQ-M .

psr:-D681HJ5Q-G
  skos:prefLabel "anneau commutatif"@fr, "commutative ring"@en ;
  a skos:Concept ;
  skos:narrower psr:-S0DPGMTQ-M .

psr:-S0DPGMTQ-M
  skos:prefLabel "polynôme de Laurent"@fr, "Laurent polynomial"@en ;
  skos:definition """Un polynôme de Laurent est une généralisation de la notion de polynôme où l'on autorise les puissances de l'indéterminée à être négatives. Introduits par le mathématicien Pierre Alphonse Laurent en 1843 pour l'étude des fonctions, afin de généraliser la série de Taylor au moyen de la série de Laurent, ils apparaissent depuis dans de nombreuses branches des mathématiques et de la physique théorique, en particulier en algèbre, dans l'étude des algèbres de Lie et en relation avec la théorie de Fourier. 
<br/>(Wikipedia, L'Encylopédie Libre, <a href="https://fr.wikipedia.org/wiki/Polyn%C3%B4me_de_Laurent">https://fr.wikipedia.org/wiki/Polyn%C3%B4me_de_Laurent</a>)"""@fr, """In mathematics, a <b>Laurent polynomial</b> (named
<br/>after Pierre Alphonse Laurent) in one variable over a field <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\\\\displaystyle \\\\mathbb {F} }">
<br/>  <semantics>
<br/>    <mrow class="MJX-TeXAtom-ORD">
<br/>      <mstyle displaystyle="true" scriptlevel="0">
<br/>        <mrow class="MJX-TeXAtom-ORD">
<br/>          <mi mathvariant="double-struck">F</mi>
<br/>        </mrow>
<br/>      </mstyle>
<br/>    </mrow>
<br/>    <annotation encoding="application/x-tex">{\\\\displaystyle \\\\mathbb {F} }</annotation>
<br/>  </semantics>
<br/></math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/573f72afae7df709959ab1a58cd643743466a187" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.42ex; height:2.176ex;" alt="\\\\mathbb {F} "></span> is a linear combination of positive and negative powers of the variable with coefficients in <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\\\\displaystyle \\\\mathbb {F} }">
<br/>  <semantics>
<br/>    <mrow class="MJX-TeXAtom-ORD">
<br/>      <mstyle displaystyle="true" scriptlevel="0">
<br/>        <mrow class="MJX-TeXAtom-ORD">
<br/>          <mi mathvariant="double-struck">F</mi>
<br/>        </mrow>
<br/>      </mstyle>
<br/>    </mrow>
<br/>    <annotation encoding="application/x-tex">{\\\\displaystyle \\\\mathbb {F} }</annotation>
<br/>  </semantics>
<br/></math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/573f72afae7df709959ab1a58cd643743466a187" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.42ex; height:2.176ex;" alt="\\\\mathbb {F} "></span>. Laurent polynomials in <i>X</i> form a ring denoted <span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\\\\displaystyle \\\\mathbb {F} [X,X^{-1}]}">
<br/>  <semantics>
<br/>    <mrow class="MJX-TeXAtom-ORD">
<br/>      <mstyle displaystyle="true" scriptlevel="0">
<br/>        <mrow class="MJX-TeXAtom-ORD">
<br/>          <mi mathvariant="double-struck">F</mi>
<br/>        </mrow>
<br/>        <mo stretchy="false">[</mo>
<br/>        <mi>X</mi>
<br/>        <mo>,</mo>
<br/>        <msup>
<br/>          <mi>X</mi>
<br/>          <mrow class="MJX-TeXAtom-ORD">
<br/>            <mo>−<!-- − --></mo>
<br/>            <mn>1</mn>
<br/>          </mrow>
<br/>        </msup>
<br/>        <mo stretchy="false">]</mo>
<br/>      </mstyle>
<br/>    </mrow>
<br/>    <annotation encoding="application/x-tex">{\\\\displaystyle \\\\mathbb {F} [X,X^{-1}]}</annotation>
<br/>  </semantics>
<br/></math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/25476c53c67fa0f9aee13105fe1ece4e8f944bf0" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.838ex; width:10.058ex; height:3.176ex;" alt="{\\\\displaystyle \\\\mathbb {F} [X,X^{-1}]}"></span>. They differ from ordinary polynomials in that they may have terms of negative degree. The construction of Laurent polynomials may be iterated, leading to the ring of Laurent polynomials in several variables.  Laurent polynomials are of particular importance in the study of complex variables. 
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Laurent_polynomial">https://en.wikipedia.org/wiki/Laurent_polynomial</a>)"""@en ;
  skos:broader psr:-SNTKWPJM-D, psr:-D681HJ5Q-G ;
  a skos:Concept ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Laurent_polynomial>, <https://fr.wikipedia.org/wiki/Polyn%C3%B4me_de_Laurent> ;
  skos:inScheme psr: ;
  dc:modified "2023-08-18"^^xsd:date ;
  dc:created "2023-08-18"^^xsd:date ;
  skos:related psr:-QLDS0DFZ-H .

psr:-SNTKWPJM-D
  skos:prefLabel "polynôme"@fr, "polynomial"@en ;
  a skos:Concept ;
  skos:narrower psr:-S0DPGMTQ-M .