{"title":"关于随机极大环积的环结构","authors":"M. Bóna, B. Pittel","doi":"10.1137/1.9781611974775.1","DOIUrl":null,"url":null,"abstract":"The subject of this paper is the cycle structure of the random permutation $\\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of cycles of $\\sigma$ and also the distribution of the elements of the subset $[\\ell]$ among the cycles of $\\sigma$.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"On the cycle structure of the product of random maximal cycles\",\"authors\":\"M. Bóna, B. Pittel\",\"doi\":\"10.1137/1.9781611974775.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The subject of this paper is the cycle structure of the random permutation $\\\\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of cycles of $\\\\sigma$ and also the distribution of the elements of the subset $[\\\\ell]$ among the cycles of $\\\\sigma$.\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611974775.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611974775.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the cycle structure of the product of random maximal cycles
The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of cycles of $\sigma$ and also the distribution of the elements of the subset $[\ell]$ among the cycles of $\sigma$.