{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T16:59:22Z","timestamp":1782233962748,"version":"3.54.5"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T00:00:00Z","timestamp":1757635200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T00:00:00Z","timestamp":1757635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006793","name":"Harvey Mudd College","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006793","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2026,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    For\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\textbf {b}}=(b_1,\\dots ,b_n)\\in \\mathbb {Z}_{&gt;0}^n$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>b<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:msub>\n                                <mml:mi>b<\/mml:mi>\n                                <mml:mn>1<\/mml:mn>\n                              <\/mml:msub>\n                              <mml:mo>,<\/mml:mo>\n                              <mml:mo>\u22ef<\/mml:mo>\n                              <mml:mo>,<\/mml:mo>\n                              <mml:msub>\n                                <mml:mi>b<\/mml:mi>\n                                <mml:mi>n<\/mml:mi>\n                              <\/mml:msub>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                            <mml:mo>\u2208<\/mml:mo>\n                            <mml:msubsup>\n                              <mml:mi>Z<\/mml:mi>\n                              <mml:mrow>\n                                <mml:mo>&gt;<\/mml:mo>\n                                <mml:mn>0<\/mml:mn>\n                              <\/mml:mrow>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msubsup>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , a\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\textbf {b}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>b<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    <jats:italic>-parking function<\/jats:italic>\n                    is defined to be a sequence\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$(\\beta _1,\\dots ,\\beta _n)$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>\u03b2<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:msub>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mo>\u22ef<\/mml:mo>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>\u03b2<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    of positive integers whose nondecreasing rearrangement\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\beta '_1\\le \\beta '_2\\le \\cdots \\le \\beta '_n$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msubsup>\n                              <mml:mi>\u03b2<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                              <mml:mo>\u2032<\/mml:mo>\n                            <\/mml:msubsup>\n                            <mml:mo>\u2264<\/mml:mo>\n                            <mml:msubsup>\n                              <mml:mi>\u03b2<\/mml:mi>\n                              <mml:mn>2<\/mml:mn>\n                              <mml:mo>\u2032<\/mml:mo>\n                            <\/mml:msubsup>\n                            <mml:mo>\u2264<\/mml:mo>\n                            <mml:mo>\u22ef<\/mml:mo>\n                            <mml:mo>\u2264<\/mml:mo>\n                            <mml:msubsup>\n                              <mml:mi>\u03b2<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                              <mml:mo>\u2032<\/mml:mo>\n                            <\/mml:msubsup>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    satisfies\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\beta '_i\\le b_1+\\cdots + b_i$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msubsup>\n                              <mml:mi>\u03b2<\/mml:mi>\n                              <mml:mi>i<\/mml:mi>\n                              <mml:mo>\u2032<\/mml:mo>\n                            <\/mml:msubsup>\n                            <mml:mo>\u2264<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>b<\/mml:mi>\n                              <mml:mn>1<\/mml:mn>\n                            <\/mml:msub>\n                            <mml:mo>+<\/mml:mo>\n                            <mml:mo>\u22ef<\/mml:mo>\n                            <mml:mo>+<\/mml:mo>\n                            <mml:msub>\n                              <mml:mi>b<\/mml:mi>\n                              <mml:mi>i<\/mml:mi>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . The\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\textbf {b}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>b<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -parking-function polytope\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathfrak {X}_{n}({\\textbf {b}})$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>X<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:mi>b<\/mml:mi>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is the convex hull of all\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\textbf {b}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>b<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -parking functions of length\n                    <jats:italic>n<\/jats:italic>\n                    in\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathbb {R}^n$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mrow>\n                              <mml:mi>R<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . Geometric properties of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathfrak {X}_{n}({\\textbf {b}})$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>X<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:mi>b<\/mml:mi>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    were previously explored in the specific case where\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\textbf {b}}=(a,b,b,\\dots ,b)$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>b<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:mi>a<\/mml:mi>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mi>b<\/mml:mi>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mi>b<\/mml:mi>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mo>\u22ef<\/mml:mo>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mi>b<\/mml:mi>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and were shown to generalize those of the classical parking-function polytope. In this work, we study\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathfrak {X}_{n}({\\textbf {b}})$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>X<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:mi>b<\/mml:mi>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    in full generality. We present a minimal inequality and vertex description for\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathfrak {X}_{n}({\\textbf {b}})$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>X<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:mi>b<\/mml:mi>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , prove it is a generalized permutahedron, and study its\n                    <jats:italic>h<\/jats:italic>\n                    -polynomial. Furthermore, we investigate\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathfrak {X}_{n}({\\textbf {b}})$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msub>\n                              <mml:mi>X<\/mml:mi>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                            <mml:mrow>\n                              <mml:mo>(<\/mml:mo>\n                              <mml:mi>b<\/mml:mi>\n                              <mml:mo>)<\/mml:mo>\n                            <\/mml:mrow>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    through the perspectives of building sets and polymatroids, allowing us to identify its combinatorial types and obtain bounds on its combinatorial and circuit diameters.\n                  <\/jats:p>","DOI":"10.1007\/s00454-025-00770-1","type":"journal-article","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T17:20:38Z","timestamp":1757697638000},"page":"339-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorics of Generalized Parking-Function Polytopes"],"prefix":"10.1007","volume":"76","author":[{"given":"Margaret M.","family":"Bayer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steffen","family":"Borgwardt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teressa","family":"Chambers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spencer","family":"Daugherty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aleyah","family":"Dawkins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danai","family":"Deligeorgaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hsin-Chieh","family":"Liao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tyrrell","family":"McAllister","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angela","family":"Morrison","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Garrett","family":"Nelson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7437-3745","authenticated-orcid":false,"given":"Andr\u00e9s R.","family":"Vindas-Mel\u00e9ndez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,12]]},"reference":[{"key":"770_CR1","doi-asserted-by":"crossref","unstructured":"Amanbayeva, A., Wang, D.: The convex hull of parking functions of length $$n$$, Enumer. Comb. Appl. 2(2) (2022), S2R10, 10","DOI":"10.54550\/ECA2022V2S2R10"},{"issue":"4","key":"770_CR2","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s00454-009-9232-9","volume":"43","author":"F Ardila","year":"2010","unstructured":"Ardila, F., Benedetti, C., Doker, J.: Matroid polytopes and their volumes. Discrete Comput. Geom. 43(4), 841\u2013854 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"770_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.aam.2017.05.003","volume":"94","author":"S Backman","year":"2018","unstructured":"Backman, S.: Partial graph orientations and the Tutte polynomial. Adv. in Appl. Math. 94, 103\u2013119 (2018)","journal-title":"Adv. in Appl. Math."},{"key":"770_CR4","unstructured":"Backman, S., Liu, G.: A regular unimodular triangulation of the matroid base polytope, S\u00e9m. Lothar. Combin. 91B (2024), Art. 92, 10"},{"issue":"4","key":"770_CR5","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1137\/1016083","volume":"16","author":"M Balinski","year":"1974","unstructured":"Balinski, M., Russakoff, A.: On the assignment polytope. SIAM Rev. 16(4), 516\u2013525 (1974)","journal-title":"SIAM Rev."},{"issue":"1","key":"770_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02558460","volume":"1","author":"JE Bartels","year":"1997","unstructured":"Bartels, J.E., Mount, J., Welsh, D.J.A.: The polytope of win vectors. Ann. Comb. 1(1), 1\u201315 (1997)","journal-title":"Ann. Comb."},{"key":"770_CR7","doi-asserted-by":"crossref","unstructured":"Behrend, R.E.: Ehrhart polynomials of partial permutohedra, (2024), arxiv:2403.06975","DOI":"10.1007\/s00454-025-00755-0"},{"key":"770_CR8","unstructured":"Behrend, RE., Castillo, F., Chavez, A.,Diaz-Lopez, A., Escobar, L., Harris, P., Insko, E.: Partial permutohedra, (2022), arXiv:2207.14253"},{"key":"770_CR9","unstructured":"Behrend, RE., Castillo, F.: Partial permutohedra, S\u00e9m. Lothar. Combin. 89B (2023), Art. 64, 12"},{"key":"770_CR10","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff, G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n. Revista A. 5, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tucum\u00e1n. Revista A."},{"issue":"4","key":"770_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1515\/advgeom-2016-0020","volume":"16","author":"S Borgwardt","year":"2016","unstructured":"Borgwardt, S., De Loera, J.A., Finhold, E.: Edges versus circuits: a hierarchy of diameters in polyhedra. Adv. Geom. 16(4), 511\u2013530 (2016)","journal-title":"Adv. Geom."},{"issue":"1","key":"770_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/140976868","volume":"29","author":"S Borgwardt","year":"2015","unstructured":"Borgwardt, S., Finhold, E., Hemmecke, R.: On the circuit diameter of dual transportation polyhedra. SIAM J. Discrete Math. 29(1), 113\u2013121 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20132","key":"770_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-015-0956-4","volume":"159","author":"S Borgwardt","year":"2016","unstructured":"Borgwardt, S., Finhold, E., Hemmecke, R.: Quadratic diameter bounds for dual network flow polyhedra. Math. Program. 159(1\u20132), 237\u2013251 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"770_CR14","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/20M1330658","volume":"35","author":"S Borgwardt","year":"2021","unstructured":"Borgwardt, S., Viss, C.: Constructing clustering transformations. SIAM J. Discrete Math. 35(1), 152\u2013178 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"770_CR15","doi-asserted-by":"crossref","unstructured":"Borgwardt, S., Viss, C.: Circuit walks in integral polyhedra, Discrete Optim. 44 (2022), 100566","DOI":"10.1016\/j.disopt.2019.100566"},{"key":"770_CR16","doi-asserted-by":"crossref","unstructured":"Braden, T., Huh, J., Matherne, JP.: Nicholas Proudfoot, and Botong Wang, A semi-small decomposition of the Chow ring of a matroid, Adv. Math. 409 (2022), 108646, 49","DOI":"10.1016\/j.aim.2022.108646"},{"key":"770_CR17","doi-asserted-by":"publisher","first-page":"7764","DOI":"10.1093\/imrn\/rnz059","volume":"10","author":"P Br\u00e4nd\u00e9n","year":"2021","unstructured":"Br\u00e4nd\u00e9n, P., Solus, L.: Symmetric decompositions and real-rootedness. Int. Math. Res. Not. IMRN 10, 7764\u20137798 (2021)","journal-title":"Int. Math. Res. Not. IMRN"},{"key":"770_CR18","doi-asserted-by":"crossref","unstructured":"Braun, B.: Unimodality problems in Ehrhart theory, Recent trends in combinatorics, IMA Vol. Math. Appl., Springer, [Cham], (159) 687\u2013711 (2016)","DOI":"10.1007\/978-3-319-24298-9_27"},{"key":"770_CR19","volume-title":"Brualdi, Combinatorial matrix classes, Encyclopedia of Mathematics and its Applications","author":"A Richard","year":"2006","unstructured":"Richard, A.: Brualdi, Combinatorial matrix classes, Encyclopedia of Mathematics and its Applications, vol. 108. Cambridge University Press, Cambridge (2006)"},{"key":"770_CR20","doi-asserted-by":"crossref","unstructured":"De Loera, J.A.: Hemmecke, R., Lee, J.: On augmentation algorithms for linear and integer-linear programming: from Edmonds-Karp to Bland and beyond. SIAM J. Optim. 25(4), 2494\u20132511 (2015)","DOI":"10.1137\/151002915"},{"key":"770_CR21","unstructured":"Doker, JS.: Geometry of generalized permutohedra, University of California, Berkeley, (2011), PhD thesis"},{"key":"770_CR22","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra, Combinatorial optimization\u2014Eureka, you shrink!, Lecture Notes in Comput. Sci.,, Springer, Berlin, (2570) 11\u201326 (2003)","DOI":"10.1007\/3-540-36478-1_2"},{"key":"770_CR23","doi-asserted-by":"crossref","unstructured":"Ekbatani, F., Natura, B., V\u00e9gh, L\u00e1szl\u00f3\u00a0A.: Circuit imbalance measures and linear programming, London Mathematical Society Lecture Note Series, Cambridge University Press, 64\u2013114, (2022)","DOI":"10.1017\/9781009093927.004"},{"key":"770_CR24","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Convex polytopes, second ed., Graduate Texts in Mathematics, vol. 221, Springer-Verlag, New York, (2003), Prepared and with a preface by Volker Kaibel, Victor Klee and G\u00fcnter M. Ziegler","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"770_CR25","doi-asserted-by":"crossref","unstructured":"Haase, C., Paffenholz, A., Piechnik, LC., Santos, F.: Existence of unimodular triangulations\u2014positive results, Mem. Amer. Math. Soc. 270 (2021), 1321, v+83","DOI":"10.1090\/memo\/1321"},{"issue":"2","key":"770_CR26","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s00026-023-00671-1","volume":"28","author":"M Hanada","year":"2024","unstructured":"Hanada, M., Lentfer, J., Vindas-Mel\u00e9ndez, A.R.: Generalized parking function polytopes. Ann. Comb. 28(2), 575\u2013613 (2024)","journal-title":"Ann. Comb."},{"issue":"4","key":"770_CR27","doi-asserted-by":"publisher","first-page":"2863","DOI":"10.1137\/21M1417958","volume":"36","author":"D Heuer","year":"2022","unstructured":"Heuer, D., Striker, J.: Partial permutation and alternating sign matrix polytopes. SIAM J. Discrete Math. 36(4), 2863\u20132888 (2022)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"770_CR28","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1112\/mtk.12122","volume":"68","author":"K Jochemko","year":"2022","unstructured":"Jochemko, K., Ravichandran, M.: Generalized permutahedra: Minkowski linear functionals and Ehrhart positivity. Mathematika 68(1), 217\u2013236 (2022)","journal-title":"Mathematika"},{"issue":"1","key":"770_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/17M1152115","volume":"33","author":"S Kafer","year":"2019","unstructured":"Kafer, S., Pashkovich, K., Sanit\u00e0, L.: On the circuit diameter of some combinatorial polytopes. SIAM J. Discrete Math. 33(1), 1\u201325 (2019)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"770_CR30","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1365\/s13291-010-0001-8","volume":"112","author":"ED Kim","year":"2010","unstructured":"Kim, E.D., Santos, F.: An update on the Hirsch conjecture. Jahresber. Deutsch. Math.-Verein. 112(2), 73\u201398 (2010)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"770_CR31","unstructured":"Liao, HC.: Stembridge codes, permutahedral varieties, and their extensions, (2024), arXiv:2403.10577"},{"key":"770_CR32","doi-asserted-by":"crossref","unstructured":"Liu, F.: On positivity of Ehrhart polynomials, Recent trends in algebraic combinatorics, Assoc. Women Math. Ser., Springer, Cham, (16) 189\u2013237 (2019)","DOI":"10.1007\/978-3-030-05141-9_6"},{"key":"770_CR33","unstructured":"Oxley, J.: Matroid theory, second ed., Oxford Graduate Texts in Mathematics, Oxford University Press, Oxford, 21 (2011)"},{"key":"770_CR34","doi-asserted-by":"publisher","first-page":"207","DOI":"10.4171\/dm\/248","volume":"13","author":"A Postnikov","year":"2008","unstructured":"Postnikov, A., Reiner, V., Williams, L.: Faces of generalized permutohedra. Doc. Math. 13, 207\u2013273 (2008)","journal-title":"Doc. Math."},{"key":"770_CR35","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1093\/imrn\/rnn153","volume":"6","author":"A Postnikov","year":"2009","unstructured":"Postnikov, A.: Permutohedra, associahedra, and beyond. Int. Math. Res. Not. IMRN 6, 1026\u20131106 (2009)","journal-title":"Int. Math. Res. Not. IMRN"},{"key":"770_CR36","unstructured":"Ralph Tyrrell Rockafellar: The elementary vectors of a subspace of $$R^{N}$$, University of North Carolina Press, Chapel Hill, NC, Combinatorial Mathematics and its Applications 104\u2013127, (1969)"},{"key":"770_CR37","doi-asserted-by":"crossref","unstructured":"Selig, T.: The stochastic sandpile model on complete graphs, Electron. J. Combin. 31(3) (2024), 3.26, 29","DOI":"10.37236\/12780"},{"issue":"1","key":"770_CR38","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"S Lloyd","year":"1971","unstructured":"Lloyd, S.: Shapley. Cores of convex games, International journal of game theory 1(1), 11\u201326 (1971)","journal-title":"Cores of convex games, International journal of game theory"},{"issue":"6","key":"770_CR39","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/00029890.2020.1747921","volume":"127","author":"R Stanley","year":"2020","unstructured":"Stanley, R.: Problem 12191, in Problems and Solutions. Amer. Math. Monthly 127(6), 563 (2020)","journal-title":"Amer. Math. Monthly"},{"issue":"4","key":"770_CR40","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00454-002-2776-6","volume":"27","author":"P Richard","year":"2002","unstructured":"Richard, P.: Stanley and Jim Pitman, A polytope related to empirical distributions, plane trees, parking functions, and the associahedron. Discrete Comput. Geom. 27(4), 603\u2013634 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"770_CR41","first-page":"286","volume":"129","author":"R Stong","year":"2022","unstructured":"Stong, R.: The Polytope of Parking Functions, Problems and Solutions. Amer. Math. Monthly 129(3), 286\u2013289 (2022)","journal-title":"Amer. Math. Monthly"},{"issue":"2","key":"770_CR42","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF02591887","volume":"30","author":"DM Topkis","year":"1984","unstructured":"Topkis, D.M.: Adjacency on polymatroids. Math. Program. 30(2), 229\u2013237 (1984)","journal-title":"Math. Program."},{"issue":"3","key":"770_CR43","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF01586058","volume":"54","author":"DM Topkis","year":"1992","unstructured":"Topkis, D.M.: Paths on polymatroids. Math. Programming 54(3), 335\u2013351 (1992)","journal-title":"Math. Programming"},{"key":"770_CR44","doi-asserted-by":"crossref","unstructured":"Neumann, J.v.: A certain zero-sum two-person game equivalent to the optimal assignment problem, Contributions to the Theory of Games, Volume II, Annals of Mathematics Studies, Princeton University Press, 28 5\u201312, (1953)","DOI":"10.1515\/9781400881970-002"},{"key":"770_CR45","unstructured":"Yan, CH.: On the enumeration of generalized parking functions, Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 2000), 147 201\u2013209 (2000)"},{"key":"770_CR46","doi-asserted-by":"crossref","unstructured":"Yan, CH.: Generalized parking functions, tree inversions, and multicolored graphs, Adv. in Appl. Math. Special issue in honor of Dominique Foata\u2019s 65th birthday (Philadelphia, PA, 2000) 27(2-3) 641\u2013670, (2001)","DOI":"10.1006\/aama.2001.0754"},{"key":"770_CR47","unstructured":"Yan, CH.: Parking functions, Handbook of enumerative combinatorics, Discrete Math. Appl. (Boca Raton), CRC Press, Boca Raton, FL, 835\u2013893 (2015)"},{"key":"770_CR48","unstructured":"Yemelichev, V.A., Koval\u00ebv, M.M., Kravtsov, K.: Polytopes, graphs and optimisation. Translated from the Russian by G.H. Lawden, Cambridge University Press (1984)"},{"key":"770_CR49","volume-title":"Ziegler, Lectures on polytopes, Graduate Texts in Mathematics","author":"M G\u00fcnter","year":"1995","unstructured":"G\u00fcnter, M.: Ziegler, Lectures on polytopes, Graduate Texts in Mathematics, vol. 152. Springer-Verlag, New York (1995)"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00770-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-025-00770-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00770-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T16:41:04Z","timestamp":1782232864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-025-00770-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,12]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["770"],"URL":"https:\/\/doi.org\/10.1007\/s00454-025-00770-1","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,12]]},"assertion":[{"value":"26 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors state that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}