{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:30:54Z","timestamp":1775061054212,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032224682","type":"print"},{"value":"9783032224699","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-22469-9_15","type":"book-chapter","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:58Z","timestamp":1775055478000},"page":"266-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Some Families of\u00a0Greedy Numerical Semigroups"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7425-7592","authenticated-orcid":false,"given":"Arnau","family":"Messegu\u00e9-Buisan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3569-3885","authenticated-orcid":false,"given":"Hebert","family":"P\u00e9rez-Ros\u00e9s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejc.2009.05.002","volume":"31","author":"A Adamaszek","year":"2010","unstructured":"Adamaszek, A., Adamaszek, M.: Combinatorics of the change-making problem. Eur. J. Comb. 31, 47\u201363 (2010)","journal-title":"Eur. J. Comb."},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/0025570X.2018.1515559","volume":"91","author":"S Chapman","year":"2018","unstructured":"Chapman, S., O\u2019Neill, C.: Factoring in the Chicken McNugget Monoid. Math. Mag. 91(5), 323\u2013336 (2018)","journal-title":"Math. Mag."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Cowen,\u00a0L.J., Cowen, R. Steinberg, A.: Totally Greedy Coin Sets and Greedy Obstructions. Electr. J. Comb. 15 (2008), $$\\#$$R90","DOI":"10.37236\/814"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Hoggartt, Jr.,\u00a0V.E.: Generalized Zeckendorf theorem. Fibonacci Q. 10(1), 89\u201394 (1972)","DOI":"10.1080\/00150517.1972.12430972"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0304-3975(94)90134-1","volume":"123","author":"D Kozen","year":"1994","unstructured":"Kozen, D., Zaks, S.: Optimal bounds for the change-making problem. Theoret. Comput. Sci. 123, 377\u2013388 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.orl.2004.06.001","volume":"33","author":"D Pearson","year":"2005","unstructured":"Pearson, D.: A polynomial-time algorithm for the change-making problem. Oper. Res. Lett. 33, 231\u2013234 (2005)","journal-title":"Oper. Res. Lett."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"P\u00e9rez-Ros\u00e9s, H.: Totally greedy sequences generated by a class of second-order linear recurrences with constant coefficients. In: Proceedings of Discrete Mathematics Days, pp. 276\u2013281 (2024). https:\/\/doi.org\/10.37536\/TYSP5643","DOI":"10.37536\/TYSP5643"},{"key":"15_CR8","unstructured":"P\u00e9rez-Ros\u00e9s, H.: Totally Greedy Sequences Defined by Second-Order Linear Recurrences With Constant Coefficients. arXiv:2405.16609. https:\/\/arxiv.org\/abs\/2405.16609"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"P\u00e9rez-Ros\u00e9s, H., Serradilla-Merinero, J.M., Bras-Amor\u00f3s, M.: Greedy sets and greedy numerical semigroups. Comm. Algebra 53(6), 2442\u20132455 (2025). https:\/\/doi.org\/10.1080\/00927872.2024.2444625","DOI":"10.1080\/00927872.2024.2444625"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"P\u00e9rez-Ros\u00e9s,\u00a0H.: totally greedy sequences defined by second-order linear recurrences with constant coefficients. In: Proceedings of ICCSA 2025, Part I. LNCS 15648, pp. 122\u2013139. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-97000-9","DOI":"10.1007\/978-3-031-97000-9_8"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Ram\u00edrez-Alfons\u00edn,\u00a0J.L: The Diophantine Frobenius Problem. Oxford University Press (2005)","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Rosales,\u00a0J.C. and P.A.\u00a0Garc\u00eda-S\u00e1nchez: Numerical Semigroups. Springer (2009)","DOI":"10.1007\/978-1-4419-0160-6"},{"key":"15_CR13","unstructured":"Zeckendorf,\u00a0E.: Repr\u00e9sentations des nombres naturels par un somme de nombres de Fibonacci ou de nombres de Lucas. Bulletin de La Society Royale des Sciences de Li\u00e8ge, 179\u2013182 (1972)"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22469-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:59Z","timestamp":1775055479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22469-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032224682","9783032224699"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22469-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"B\u0119dlewo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}