{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:45:21Z","timestamp":1725630321459},"reference-count":18,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T00:00:00Z","timestamp":1349049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"ERC"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1016\/j.ejc.2012.03.012","type":"journal-article","created":{"date-parts":[[2012,3,30]],"date-time":"2012-03-30T22:30:19Z","timestamp":1333146619000},"page":"1467-1478","source":"Crossref","is-referenced-by-count":8,"title":["Odd permutations are nicer than even ones"],"prefix":"10.1016","volume":"33","author":[{"given":"Robert","family":"Cori","sequence":"first","affiliation":[]},{"given":"Michel","family":"Marcus","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Schaeffer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2012.03.012_br000005","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/0097-3165(72)90102-1","article-title":"Even permutations as a product of two conjugate cycles","volume":"12","author":"Bertram","year":"1972","journal-title":"J. Comb. Theory (A)"},{"key":"10.1016\/j.ejc.2012.03.012_br000010","first-page":"B51a","article-title":"Nombre de factorisations d\u2019un grand cycle","volume":"51","author":"Biane","year":"2004","journal-title":"Seminaire Lotharingien de Combinatoire"},{"key":"10.1016\/j.ejc.2012.03.012_br000015","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(80)90001-1","article-title":"Nombre de repr\u00e9sentations d\u2019une permutation comme produit de deux cycles de longueurs donn\u00e9es","volume":"29","author":"Boccara","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2012.03.012_br000020","doi-asserted-by":"crossref","unstructured":"M. B\u00f3na, R. Flynn, The average number of block interchanges needed to sort a permutation and a recent result of Stanley. Preprint arXiv:0811.0740, 2008.","DOI":"10.1016\/j.ipl.2009.04.019"},{"key":"10.1016\/j.ejc.2012.03.012_br000025","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/S0195-6698(03)00107-0","article-title":"Factorizations of an n-cycle into two n-cycles","volume":"24","author":"Cangelmi","year":"2003","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.ejc.2012.03.012_br000030","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1006\/eujc.1997.0197","article-title":"A representation of even permutations","volume":"19","author":"Cangelmi","year":"1998","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.ejc.2012.03.012_br000035","unstructured":"V. Feray, E. Vassilieva, Linear coefficients of Kerov\u2019s polynomials: bijective proof and refinement of Stanley\u2019s result. In: Proceedings FPSAC 2010, San Francisco, 2010."},{"key":"10.1016\/j.ejc.2012.03.012_br000040","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1006\/eujc.1998.0215","article-title":"Factoring n-cycles and counting maps of given genus","volume":"1","author":"Goupil","year":"1998","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.ejc.2012.03.012_br000045","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1090\/S0002-9947-1987-0869231-9","article-title":"Counting cycles in permutations by group characters with an application to a topological problem","volume":"299","author":"Jackson","year":"1987","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2012.03.012_br000050","unstructured":"G. Jones, Trees, permutations and characters, University of Southampton, 1997, unpublished manuscript."},{"key":"10.1016\/j.ejc.2012.03.012_br000055","unstructured":"A. Lehman, Enumeration of one-vertex one-face rooted maps, University of Toronto, 1973, Unpublished manuscript."},{"key":"10.1016\/j.ejc.2012.03.012_br000060","first-page":"273","article-title":"On the representation of odd permutations","volume":"13","author":"Mach\u00ec","year":"1992","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2012.03.012_br000065","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1090\/S0002-9939-1951-0040298-4","article-title":"Some remarks on commutators","volume":"2","author":"Ore","year":"1951","journal-title":"Proc. Amer. Math. Soc"},{"key":"10.1016\/j.ejc.2012.03.012_br000070","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0012-365X(01)00361-2","article-title":"Factorizations of large cycles in the symmetric group","volume":"254","author":"Poulalhon","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2012.03.012_br000075","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(81)90224-7","article-title":"Factorization of permutations into n-cycles","volume":"37","author":"Stanley","year":"1981","journal-title":"Discrete Maths."},{"key":"10.1016\/j.ejc.2012.03.012_br000080","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.ejc.2011.01.011","article-title":"Two enumerative results on cycles of permutations","volume":"32","author":"Stanley","year":"2011","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2012.03.012_br000085","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(79)90138-9","article-title":"How many ways can a permutation be factored into two n-cycles","volume":"28","author":"Walkup","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2012.03.012_br000090","first-page":"489","article-title":"On the distribution of the number of cycles of elements in symmetric groups","volume":"13","author":"Zagier","year":"1995","journal-title":"Nieuw Arch. Wiskd."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669812000510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669812000510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T06:37:36Z","timestamp":1561531056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669812000510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["S0195669812000510"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2012.03.012","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2012,10]]}}}