关于随机极大环积的环结构

M. Bóna, B. Pittel
{"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}
引用次数: 6

摘要

本文的主题是$[N]$的随机排列$\sigma$的循环结构,它是$k$最大长度$N$的独立随机循环的乘积。我们使用基于字符的傅里叶变换来研究$\sigma$的循环数以及$\sigma$的循环中$[\ well]$子集的元素的分布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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$.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Protection Number of Recursive Trees Ranked Schröder Trees QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract) Subcritical random hypergraphs, high-order components, and hypertrees Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1