{"intvolume":"        26","issue":"2","date_updated":"2023-05-24T13:13:51Z","scopus_import":"1","year":"2001","type":"journal_article","article_type":"original","publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T11:57:33Z","publication":"Discrete & Computational Geometry","doi":"10.1007/s00454-001-0028-9","publist_id":"4506","author":[{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"},{"last_name":"Welzl","first_name":"Emo","full_name":"Welzl, Emo"}],"_id":"2419","acknowledgement":"We are indebted to Rolf Schneider for many helpful remarks and in particular for bringing reference [6] to our attention","extern":"1","language":[{"iso":"eng"}],"volume":26,"publication_identifier":{"issn":["0179-5376"]},"oa_version":"None","status":"public","citation":{"ista":"Wagner U, Welzl E. 2001. A continuous analogue of the Upper Bound Theorem. Discrete &#38; Computational Geometry. 26(2), 205–219.","chicago":"Wagner, Uli, and Emo Welzl. “A Continuous Analogue of the Upper Bound Theorem.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2001. <a href=\"https://doi.org/10.1007/s00454-001-0028-9\">https://doi.org/10.1007/s00454-001-0028-9</a>.","ama":"Wagner U, Welzl E. A continuous analogue of the Upper Bound Theorem. <i>Discrete &#38; Computational Geometry</i>. 2001;26(2):205-219. doi:<a href=\"https://doi.org/10.1007/s00454-001-0028-9\">10.1007/s00454-001-0028-9</a>","ieee":"U. Wagner and E. Welzl, “A continuous analogue of the Upper Bound Theorem,” <i>Discrete &#38; Computational Geometry</i>, vol. 26, no. 2. Springer, pp. 205–219, 2001.","mla":"Wagner, Uli, and Emo Welzl. “A Continuous Analogue of the Upper Bound Theorem.” <i>Discrete &#38; Computational Geometry</i>, vol. 26, no. 2, Springer, 2001, pp. 205–19, doi:<a href=\"https://doi.org/10.1007/s00454-001-0028-9\">10.1007/s00454-001-0028-9</a>.","short":"U. Wagner, E. Welzl, Discrete &#38; Computational Geometry 26 (2001) 205–219.","apa":"Wagner, U., &#38; Welzl, E. (2001). A continuous analogue of the Upper Bound Theorem. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-001-0028-9\">https://doi.org/10.1007/s00454-001-0028-9</a>"},"page":"205 - 219","publisher":"Springer","title":"A continuous analogue of the Upper Bound Theorem","article_processing_charge":"No","abstract":[{"lang":"eng","text":"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."}],"month":"01","quality_controlled":"1","day":"01","date_published":"2001-01-01T00:00:00Z"}