@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:-WVB8LP7M-L
  skos:prefLabel "polytope"@en, "polytope"@fr ;
  a skos:Concept ;
  skos:narrower psr:-F626R8QK-X .

psr:-J6FSMPXC-8
  skos:prefLabel "Euler measure"@en, "mesure d'Euler"@fr ;
  a skos:Concept ;
  skos:related psr:-F626R8QK-X .

psr:-ZTD7VMDS-3
  skos:prefLabel "analyse convexe"@fr, "convex analysis"@en ;
  a skos:Concept ;
  skos:narrower psr:-F626R8QK-X .

psr: a skos:ConceptScheme .
psr:-WN8V9LNG-0
  skos:prefLabel "associahedron"@en, "associaèdre"@fr ;
  a skos:Concept ;
  skos:broader psr:-F626R8QK-X .

psr:-F626R8QK-X
  skos:broader psr:-WVB8LP7M-L, psr:-ZTD7VMDS-3 ;
  skos:definition """A <b>convex polytope</b> is a special case of a polytope, having the additional property that it is also a convex set contained in the <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 n}">   <semantics>     <mrow class="MJX-TeXAtom-ORD">       <mstyle displaystyle="true" scriptlevel="0">         <mi>n</mi>       </mstyle>     </mrow>     <annotation encoding="application/x-tex">{\\\\displaystyle n}</annotation>   </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/a601995d55609f2d9f5e233e36fbe9ea26011b3b" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\\\\displaystyle n}"></span>-dimensional Euclidean space <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 {R} ^{n}}">   <semantics>     <mrow class="MJX-TeXAtom-ORD">       <mstyle displaystyle="true" scriptlevel="0">         <msup>           <mrow class="MJX-TeXAtom-ORD">             <mi mathvariant="double-struck">R</mi>           </mrow>           <mrow class="MJX-TeXAtom-ORD">             <mi>n</mi>           </mrow>         </msup>       </mstyle>     </mrow>     <annotation encoding="application/x-tex">{\\\\displaystyle \\\\mathbb {R} ^{n}}</annotation>   </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/c510b63578322050121fe966f2e5770bea43308d" class="mwe-math-fallback-image-inline mw-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:2.897ex; height:2.343ex;" alt="{\\\\displaystyle \\\\mathbb {R} ^{n}}"></span>. Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.  
<br/>(Wikipedia, The Free Encyclopedia, <a href="https://en.wikipedia.org/wiki/Convex_polytope">https://en.wikipedia.org/wiki/Convex_polytope</a>)"""@en ;
  skos:exactMatch <https://en.wikipedia.org/wiki/Convex_polytope> ;
  skos:narrower psr:-WN8V9LNG-0 ;
  dc:modified "2024-10-18"^^xsd:date ;
  skos:prefLabel "convex polytope"@en, "polytope convexe"@fr ;
  skos:related psr:-J6FSMPXC-8 ;
  dc:created "2023-08-18"^^xsd:date ;
  skos:inScheme psr: ;
  a skos:Concept .

