{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:37:28Z","timestamp":1742387848064,"version":"3.38.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:00:00Z","timestamp":1706832000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:00:00Z","timestamp":1706832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["882971"],"award-info":[{"award-number":["882971"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","doi-asserted-by":"publisher","award":["K-131529"],"award-info":[{"award-number":["K-131529"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]},{"name":"HUN-REN Alfr\u00e9d R\u00e9nyi Institute of Mathematics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Given a set of <jats:italic>n<\/jats:italic> labeled points in general position in the plane, we remove all of its points one by one. At each step, one point from the convex hull of the remaining set is erased. In how many ways can the process be carried out? The answer obviously depends on the point set. If the points are in convex position, there are exactly <jats:italic>n<\/jats:italic>! ways, which is the maximum number of ways for <jats:italic>n<\/jats:italic> points. But what is the minimum number? It is shown that this number is (roughly) at least <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$3^n$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mn>3<\/mml:mn>\n                    <mml:mi>n<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and at most <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$12.29^n$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>12<\/mml:mn>\n                    <mml:mo>.<\/mml:mo>\n                    <mml:msup>\n                      <mml:mn>29<\/mml:mn>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00454-023-00616-8","type":"journal-article","created":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T15:02:38Z","timestamp":1706886158000},"page":"837-849","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Peeling Sequences"],"prefix":"10.1007","volume":"73","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1751-6911","authenticated-orcid":false,"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,2]]},"reference":[{"issue":"7","key":"616_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112424","volume":"344","author":"G Ambrus","year":"2021","unstructured":"Ambrus, G., Nielsen, P., Wilson, C.: New estimates for convex layer numbers. Discret. Math. 344(7), 112424 (2021)","journal-title":"Discret. Math."},{"issue":"4","key":"616_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","volume":"31","author":"B Chazelle","year":"1985","unstructured":"Chazelle, B.: On the convex layers of a planar set. IEEE Trans. Inf. Theory 31(4), 509\u2013517 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"616_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/rsa.10114","volume":"24","author":"K Dalal","year":"2004","unstructured":"Dalal, K.: Counting the onion. Random Struct. Algorithms 24(2), 155\u2013165 (2004)","journal-title":"Random Struct. Algorithms"},{"key":"616_CR4","doi-asserted-by":"publisher","unstructured":"Dumitrescu, A.: Peeling sequences. Mathematics10, 4287 (2022). https:\/\/doi.org\/10.3390\/math10224287. Preprint. arXiv:2211.05968","DOI":"10.3390\/math10224287"},{"key":"616_CR5","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A.: Peeling sequences, communication at the joint Budapest Big Combinatorics + Geometry (BBC+G) Seminar, February 2023. https:\/\/coge.elte.hu\/seminar.html","DOI":"10.1007\/s00454-023-00616-8"},{"issue":"1","key":"616_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0097-3165(85)90017-2","volume":"38","author":"H Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., Welzl, E.: On the number of line separations of a finite set in the plane. J. Combin. Theory Ser. A 38(1), 15\u201329 (1986)","journal-title":"J. Combin. Theory Ser. A"},{"key":"616_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7970-4","volume-title":"Entropy and Information Theory","author":"RM Gray","year":"2011","unstructured":"Gray, R.M.: Entropy and Information Theory, 2nd edn. Springer, New York (2011)","edition":"2"},{"issue":"2","key":"616_CR8","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/120892660","volume":"27","author":"S Har-Peled","year":"2013","unstructured":"Har-Peled, S., Lidick\u00fd, B.: Peeling the grid. SIAM J. Discret. Math. 27(2), 650\u2013655 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"616_CR9","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis, 2nd\u00a0edn. Cambridge University Press, Cambridge (2017)"},{"issue":"2","key":"616_CR10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"MH Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"616_CR11","first-page":"251","volume-title":"Recent Results and New Directions in Algorithms and Complexity (Joseph","author":"MI Shamos","year":"1976","unstructured":"Shamos, M.I.: Geometry and statistics: problems at the interface. In: Traub, F. (ed.) Recent Results and New Directions in Algorithms and Complexity (Joseph, pp. 251\u2013280. Academic Press, New York (1976)"},{"key":"616_CR12","unstructured":"Shamos, M.I.: Problems in Computational Geometry. PhD Thesis, Yale University (1978)"},{"key":"616_CR13","doi-asserted-by":"crossref","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. http:\/\/oeis.org. Accessed 1 Dec 2022","DOI":"10.37236\/1194"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00616-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00616-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00616-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T14:57:58Z","timestamp":1742223478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00616-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,2]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00616-8","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2024,2,2]]},"assertion":[{"value":"28 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}