<?xml version="1.0" encoding="UTF-8"?>
<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">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>A continuous analogue of the Upper Bound Theorem</dc:title>
   	<dc:creator>Wagner, Uli ; https://orcid.org/0000-0002-1494-0568</dc:creator>
   	<dc:creator>Welzl, Emo</dc:creator>
   	<dc:description>For an absolutely continuous probability measure μ. on ℝd and a nonnegative integer k, let S̃k(μ, 0) denote the probability that the convex hull of k + d + 1 random points which are i.i.d. according to μ contains the origin 0. For d and k given, we determine a tight upper bound on S̃k(μ, 0), and we characterize the measures in ℝd which attain this bound. As we will see, this result can be considered a continuous analogue of the Upper Bound Theorem for the maximal number of faces of convex polytopes with a given number of vertices. For our proof we introduce so-called h-functions, continuous counterparts of h-vectors of simplicial convex polytopes.</dc:description>
   	<dc:publisher>Springer</dc:publisher>
   	<dc:date>2001</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:Article</dc:type>
   	<dc:type>Article</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_2df8fbb1</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/2419</dc:identifier>
   	<dc:source>Wagner U, Welzl E. A continuous analogue of the Upper Bound Theorem. &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;. 2001;26(2):205-219. doi:&lt;a href=&quot;https://doi.org/10.1007/s00454-001-0028-9&quot;&gt;10.1007/s00454-001-0028-9&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/s00454-001-0028-9</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/0179-5376</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
