{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:51:06Z","timestamp":1768733466627,"version":"3.49.0"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p> In this paper, we present a multiset analogue of the even-odd permutations identity in the context of combinatorics of words. The multiset version is indeed equivalent to the coin arrangements lemma which is a key lemma in Sherman\u2019s proof of Feynman\u2019s conjecture about combinatorial solution of Ising model in statistical physics. Here, we give a bijective proof which is based on the standard factorization of a Lyndon word. <\/jats:p>","DOI":"10.1142\/s0129054119500163","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T08:24:14Z","timestamp":1565684654000},"page":"683-691","source":"Crossref","is-referenced-by-count":2,"title":["A Multiset Version of Even-Odd Permutations Identity"],"prefix":"10.1142","volume":"30","author":[{"given":"Hossein","family":"Teimoori Faal","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Allameh Tabataba\u2019i University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"S0129054119500163BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BF02980577"},{"key":"S0129054119500163BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01342928"},{"key":"S0129054119500163BIB003","doi-asserted-by":"publisher","DOI":"10.1063\/1.1703653"},{"key":"S0129054119500163BIB004","volume-title":"The Theory of Groups","author":"Hall M.","year":"1976"},{"key":"S0129054119500163BIB005","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097"},{"key":"S0129054119500163BIB006","volume-title":"Discrete Mathematics and Its Applications","author":"Bona M.","year":"2012","edition":"2"},{"key":"S0129054119500163BIB007","volume-title":"Seminumerical Algorithms","volume":"2","author":"Knuth D. E.","year":"1981","edition":"2"},{"key":"S0129054119500163BIB008","series-title":"Discrete Mathematics and Its Applications","volume-title":"A Combinatorial Approach to Matrix Theory and Its Applications","author":"Brualdi Richard A.","year":"2009"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054119500163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T08:24:46Z","timestamp":1565684686000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054119500163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":8,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2019,8,13]]},"published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.1142\/S0129054119500163"],"URL":"https:\/\/doi.org\/10.1142\/s0129054119500163","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}