{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:59:10Z","timestamp":1762783150708,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031690693"},{"type":"electronic","value":"9783031690709"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-69070-9_9","type":"book-chapter","created":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T11:23:00Z","timestamp":1724325780000},"page":"140-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting the\u00a0Integer Points of\u00a0Parametric Polytopes: A Maple Implementation"],"prefix":"10.1007","author":[{"given":"Rui-Juan","family":"Jing","sequence":"first","affiliation":[]},{"given":"Yuzhuo","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Christopher F. S.","family":"Maligec","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Moreno Maza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.exmath.2013.01.004","volume":"31","author":"A Aparicio Monforte","year":"2013","unstructured":"Aparicio Monforte, A., Kauers, M.: Formal Laurent series in several variables. Expo. Math. 31(4), 350\u2013367 (2013)","journal-title":"Expo. Math."},{"issue":"1\u20133","key":"9_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65(1\u20133), 21\u201346 (1996)","journal-title":"Discret. Appl. Math."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A Course in Convexity, vol.\u00a054. American Mathematical Soc., USA (2002)","DOI":"10.1090\/gsm\/054"},{"key":"9_CR4","first-page":"91","volume":"38","author":"A Barvinok","year":"1999","unstructured":"Barvinok, A., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. New Perspect. Algebraic Comb. 38, 91\u2013147 (1999)","journal-title":"New Perspect. Algebraic Comb."},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"AI Barvinok","year":"1994","unstructured":"Barvinok, A.I.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19(4), 769\u2013779 (1994)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00283-008-9013-y","volume":"31","author":"M Beck","year":"2009","unstructured":"Beck, M., Haase, C., Sottile, F.: Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones. Math. Intell. 31(1), 9\u201317 (2009)","journal-title":"Math. Intell."},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.jcta.2007.05.009","volume":"115","author":"M Beck","year":"2008","unstructured":"Beck, M., Sam, S.V., Woods, K.M.: Maximal periods of Ehrhart quasi-polynomials. J. Comb. Theory Ser. A 115(3), 517\u2013525 (2008)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-7721(01)00004-9","volume":"18","author":"A Bemporad","year":"2001","unstructured":"Bemporad, A., Fukuda, K., Torrisi, F.D.: Convexity recognition of the union of polyhedra. Comput. Geom. 18(3), 141\u2013154 (2001)","journal-title":"Comput. Geom."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Brion, M.: Points entiers dans les polyedres convexes. In: Annales scientifiques de l\u2019\u00c9cole normale sup\u00e9rieure, vol.\u00a021, pp. 653\u2013663 (1988)","DOI":"10.24033\/asens.1572"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Clauss, P., Fern\u00e1ndez, F.J., Garbervetsky, D., Verdoolaege, S.: Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. IEEE Trans. Very Large Scale Integr. Syst. 17(8), 983\u2013996 (2009)","DOI":"10.1109\/TVLSI.2008.2002049"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-030-60026-6_11","volume-title":"Computer Algebra in Scientific Computing","author":"RM Corless","year":"2020","unstructured":"Corless, R.M., Giesbrecht, M., Rafiee Sevyeri, L., Saunders, B.D.: On parametric linear system solving. In: Boulier, F., England, M., Sadykov, T.M., Vorozhtsov, E.V. (eds.) CASC 2020. LNCS, vol. 12291, pp. 188\u2013205. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60026-6_11"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Dahan, X., Moreno Maza, M., Schost, \u00c9., Wu, W., Xie, Y.: Lifting techniques for triangular decompositions. In: Kauers, M. (ed.) Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, 24\u201327 July 2005, Proceedings, pp. 108\u2013115. ACM (2005)","DOI":"10.1145\/1073884.1073901"},{"key":"9_CR13","unstructured":"Fukuda, K.: C-implementation of the double description method for computing all vertices and extremal rays of a convex polyhedron given by a system of linear inequalities. Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland (1993)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Gao, X.S., Chou, S.C.: Computations with parametric equations. In: Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, pp. 122\u2013127 (1991)","DOI":"10.1145\/120694.120710"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez Trochez, J.P., Moreno Maza, M., Postma, E., Calder, M.: Laurent series and Puiseux series in Maple. Maple Trans. 3(2) (2023)","DOI":"10.5206\/mt.v3i2.16000"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-66320-3_17","volume-title":"Computer Algebra in Scientific Computing","author":"R-J Jing","year":"2017","unstructured":"Jing, R.-J., Moreno\u00a0Maza, M.: Computing the integer points of a polyhedron, i: algorithm. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2017. LNCS, vol. 10490, pp. 225\u2013241. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66320-3_17"},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.jsc.2007.01.007","volume":"42","author":"D Lazard","year":"2007","unstructured":"Lazard, D., Rouillier, F.: Solving parametric polynomial systems. J. Symb. Comput. 42(6), 636\u2013667 (2007)","journal-title":"J. Symb. Comput."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1023\/A:1025117523902","volume":"25","author":"V Loechner","year":"1997","unstructured":"Loechner, V., Wilde, D.K.: Parameterized polyhedra and their vertices. Int. J. Parallel Prog. 25, 525\u2013549 (1997)","journal-title":"Int. J. Parallel Prog."},{"issue":"4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"JAD Loera","year":"2004","unstructured":"Loera, J.A.D., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput. 38(4), 1273\u20131302 (2004)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s11786-012-0136-3","volume":"6","author":"M Moreno Maza","year":"2012","unstructured":"Moreno Maza, M., Xia, B., Xiao, R.: On solving parametric polynomial systems. Math. Comput. Sci. 6(4), 457\u2013473 (2012)","journal-title":"Math. Comput. Sci."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Pugh, W.W.: The omega test: a fast and practical integer programming algorithm for dependence analysis. In: Proceedings Supercomputing \u201991, Albuquerque, NM, USA, 18\u201322 November 1991, pp. 4\u201313. ACM (1991)","DOI":"10.1145\/125826.125848"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Pugh, W.W.: Counting solutions to presburger formulas: how and why. In: Proceedings of the ACM SIGPLAN\u201994 Conference on Programming Language Design and Implementation (PLDI), Orlando, Florida, USA, 20\u201324 June 1994, pp. 121\u2013134. ACM (1994)","DOI":"10.1145\/178243.178254"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1365\/s13291-022-00256-6","volume":"125","author":"B Sambale","year":"2023","unstructured":"Sambale, B.: An invitation to formal power series. Jahresber. Deutsch. Math.-Verein. 125(1), 3\u201369 (2023)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"9_CR24","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 1, Second edition. Cambridge studies in advanced mathematics, Cambridge (2011)"},{"key":"9_CR25","unstructured":"Verdoolaege, S.: Integer set coalescing. In: International Workshop on Polyhedral Compilation Techniques, Date: 2015\/01\/19\u20132015\/01\/19, Amsterdam, The Netherlands (2015)"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00453-006-1231-0","volume":"48","author":"S Verdoolaege","year":"2007","unstructured":"Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using Barvinok\u2019s rational functions. Algorithmica 48(1), 37\u201366 (2007)","journal-title":"Algorithmica"},{"issue":"1","key":"9_CR27","first-page":"1","volume":"21","author":"K Woods","year":"2014","unstructured":"Woods, K.: The unreasonable ubiquitousness of quasi-polynomials. Electron. J. Comb. 21(1), 1\u201344 (2014)","journal-title":"Electron. J. Comb."},{"issue":"1\u20132","key":"9_CR28","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jsco.1998.0274","volume":"28","author":"L Yang","year":"1999","unstructured":"Yang, L.: Recent advances on determining the number of real roots of parametric polynomials. J. Symb. Comput. 28(1\u20132), 225\u2013242 (1999)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-69070-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T11:36:12Z","timestamp":1724326572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-69070-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031690693","9783031690709"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-69070-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}