{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:44:35Z","timestamp":1740120275014,"version":"3.37.3"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-2016-03632"],"award-info":[{"award-number":["RGPIN-2016-03632"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-2017-04157"],"award-info":[{"award-number":["RGPIN-2017-04157"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p> Given a finitely generated group with generating set [Formula: see text], we study the cogrowth sequence, which is the number of words of length [Formula: see text] over the alphabet [Formula: see text] that are equal to the identity in the group. This is related to the probability of return for walks on the corresponding Cayley graph. Muller and Schupp proved the generating function of the sequence is algebraic when [Formula: see text] has a finite-index-free subgroup (using a result of Dunwoody). In this work, we make this result effective for free products of finite groups: we determine bounds for the degree and height of the minimal polynomial of the generating function, and determine the minimal polynomial explicitly for some families of free products. Using these results we are able to prove that a gap theorem holds: if [Formula: see text] is a finite symmetric generating set for a group [Formula: see text] and if [Formula: see text] denotes the number of words of length [Formula: see text] over the alphabet [Formula: see text] that are equal to [Formula: see text] then [Formula: see text] is either [Formula: see text], [Formula: see text] or at least [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0218196723500133","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T13:20:13Z","timestamp":1670246413000},"page":"237-260","source":"Crossref","is-referenced-by-count":0,"title":["Cogrowth series for free products of finite groups"],"prefix":"10.1142","volume":"33","author":[{"given":"Jason","family":"Bell","sequence":"first","affiliation":[{"name":"Department of Pure Mathematics, University of Waterloo, Waterloo, ON, N2L 3G1, Canada"}]},{"given":"Haggai","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Simon Fraser University, Burnaby, BC, V5A 1S6, Canada"}]},{"given":"Marni","family":"Mishna","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Simon Fraser University, Burnaby, BC, V5A 1S6, Canada"}]}],"member":"219","published-online":{"date-parts":[[2023,1,14]]},"reference":[{"issue":"1","key":"S0218196723500133BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10986-017-9339-2","volume":"57","author":"Alkauskas G.","year":"2017","journal-title":"Lithuanian Math. J."},{"key":"S0218196723500133BIB002","first-page":"18","volume":"4","author":"Anisimov A. V.","year":"1971","journal-title":"Kibernetika"},{"issue":"1","key":"S0218196723500133BIB003","doi-asserted-by":"crossref","first-page":"73","DOI":"10.4171\/JCA\/39","volume":"4","author":"Bell J.","year":"2020","journal-title":"J. Combin. Algebra"},{"key":"S0218196723500133BIB004","unstructured":"A. Bostan,  F. Chyzak,  M. Giusti,  R. Lebreton,  G. Lecerf,  B. Salvy and  \u00c9. Schost,  Algorithmes Efficaces en Calcul Formel,   F. Chyzak (auto-\u00e9dit.)  (CreateSpace,  Palaiseau,  2017), p.  686 (Aussi disponible en version \u00e9lectronique)."},{"key":"S0218196723500133BIB005","series-title":"ISSAC \u201907","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1277548.1277553","volume-title":"Proc. 2007 Int. Symp. Symbolic and Algebraic Computation","author":"Bostan A.","year":"2007"},{"key":"S0218196723500133BIB006","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"Chomsky N.","year":"1963"},{"volume-title":"Abstract Algebra","year":"2004","author":"Dummit D. S.","key":"S0218196723500133BIB007"},{"key":"S0218196723500133BIB008","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"Flajolet P.","year":"2009"},{"issue":"12","key":"S0218196723500133BIB009","doi-asserted-by":"crossref","first-page":"3753","DOI":"10.1093\/imrn\/rny125","volume":"2020","author":"Gray R. D.","year":"2020","journal-title":"Int. Math. Res. Not."},{"issue":"10","key":"S0218196723500133BIB010","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1090\/S0002-9939-98-04741-8","volume":"126","author":"Kouksov D.","year":"1998","journal-title":"Proc. Amer. Math. Soc."},{"key":"S0218196723500133BIB011","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","volume":"5","author":"Kuich W.","year":"1986"},{"issue":"1","key":"S0218196723500133BIB012","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1017\/S001708959997026X","volume":"41","author":"Kuksov D.","year":"1999","journal-title":"Glasg. Math. J."},{"key":"S0218196723500133BIB014","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","volume":"26","author":"Muller D. E.","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"S0218196723500133BIB015","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511735127","volume-title":"Lectures on the Combinatorics of Free Probability","author":"Nica A.","year":"2006"},{"key":"S0218196723500133BIB016","first-page":"3","volume":"44","author":"Novikov P. S.","year":"1955","journal-title":"Tr. Mat. Inst. Steklova"},{"key":"S0218196723500133BIB017","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/178365.178368","volume":"20","author":"Salvy B.","year":"1994","journal-title":"ACM Trans. Math. Software"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196723500133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T06:41:07Z","timestamp":1682664067000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0218196723500133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,14]]},"references-count":16,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["10.1142\/S0218196723500133"],"URL":"https:\/\/doi.org\/10.1142\/s0218196723500133","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"type":"print","value":"0218-1967"},{"type":"electronic","value":"1793-6500"}],"subject":[],"published":{"date-parts":[[2023,1,14]]}}}