{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:47:09Z","timestamp":1725828429520},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319236599"},{"type":"electronic","value":"9783319236605"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23660-5_8","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:05:10Z","timestamp":1440590710000},"page":"85-96","source":"Crossref","is-referenced-by-count":0,"title":["New Formulas for Dyck Paths in a Rectangle"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Eduardo","family":"Bla\u017eek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058520","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"2011","unstructured":"Stanley, R.P.: Enumerative Combinatorics, 2nd edn. Cambridge University Press, New York (2011)","edition":"2"},{"key":"8_CR2","volume-title":"Combinatorial Species and Tree-like Structures, Encyclopedia of Mathematics and its Applications","author":"F Bergeron","year":"1998","unstructured":"Bergeron, F., Labelle, G., Leroux, P., Readdy, M.: Combinatorial Species and Tree-like Structures, Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1998)"},{"key":"8_CR3","volume-title":"Automata, Languages, and Machines","author":"S Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press Inc, Orlando (1976)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(90)90039-K","volume":"82","author":"J Labelle","year":"1990","unstructured":"Labelle, J., Yeh, Y.: Generalized dyck paths. Discrete Math. 82(1), 1\u20136 (1990)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"8_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0012-365X(00)00150-3","volume":"225","author":"P Duchon","year":"2000","unstructured":"Duchon, P.: On the enumeration and generation of generalized dyck words. Discrete Math. 225(1\u20133), 121\u2013135 (2000)","journal-title":"Discrete Math."},{"key":"8_CR6","unstructured":"Fukukawa, Y.: Counting generalized Dyck paths, April 2013. arXiv:1304.5595v1 [math.CO]"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gorky, E., Mazin, M., Vazirani, M.: Affine permutations and rational slope parking functions, March 2014. arXiv:1403.0303v1 [math.CO]","DOI":"10.46298\/dmtcs.2450"},{"key":"8_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"key":"8_CR9","volume-title":"Catalan Numbers with Applications","author":"T Koshy","year":"2009","unstructured":"Koshy, T.: Catalan Numbers with Applications. Oxford University Press, New York (2009)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.jcta.2003.09.004","volume":"104","author":"I Goulden","year":"2003","unstructured":"Goulden, I., Serrano, L.: Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope. J. Comb. Theory Ser. A 104, 317\u2013326 (2003)","journal-title":"J. Comb. Theory Ser. A"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.jcta.2008.05.002","volume":"116","author":"RJ Chapman","year":"2009","unstructured":"Chapman, R.J., Chow, T., Khetan, A., Moulton, D.P., Waters, R.J.: Simple formulas for lattice paths avoiding certain periodic staircase boundaries. J. Comb. Theory Ser. A 116, 205\u2013214 (2009)","journal-title":"J. Comb. Theory Ser. A"},{"key":"8_CR12","first-page":"55","volume":"80","author":"MTL Bizley","year":"1954","unstructured":"Bizley, M.T.L.: Derivation of a new formula for the number of minimal lattice paths from $$(0,0)$$ to $$(km, kn) \\cdots $$ . JIA 80, 55\u201362 (1954)","journal-title":"JIA"},{"key":"8_CR13","first-page":"30","volume":"16","author":"G Melan\u00e7on","year":"2013","unstructured":"Melan\u00e7on, G., Reutenauer, C.: On a class of Lyndon words extending Christoffel words and related to a multidimensional continued fraction algorithm. J. Integer Sequences 16, 30 (2013)","journal-title":"J. Integer Sequences"},{"key":"8_CR14","unstructured":"Blazek, J.E.: Conbinatoire de $$\\mathbb{N}$$ -modules Catalan, Master thesis. D\u00e9partement de Math\u00e9matique, UQAM (2015)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23660-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T23:10:47Z","timestamp":1653088247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23660-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319236599","9783319236605"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23660-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}