{"title":"A central limit theorem for a card shuffling problem","authors":"Shane Chern , Lin Jiu , Italo Simonelli","doi":"10.1016/j.jcta.2025.106048","DOIUrl":null,"url":null,"abstract":"<div><div>Given a positive integer <em>n</em>, consider a permutation of <em>n</em> objects chosen uniformly at random. In this permutation, we collect maximal subsequences consisting of consecutive numbers arranged in ascending order called blocks. Each block is then merged, and after all merges, the elements of this new set are relabeled from 1 to the current number of elements. We continue to permute and merge this new set uniformly at random until only one object is left. In this paper, we investigate the distribution of <span><math><msub><mrow><mi>X</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, the number of permutations needed for this process to end. In particular, we find explicit asymptotic expressions for the mean value <span><math><mi>E</mi><mo>[</mo><msub><mrow><mi>X</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>]</mo></math></span>, the variance <span><math><mrow><mi>Var</mi></mrow><mo>[</mo><msub><mrow><mi>X</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>]</mo></math></span>, and higher central moments, and show that <span><math><msub><mrow><mi>X</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> satisfies a central limit theorem.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"214 ","pages":"Article 106048"},"PeriodicalIF":0.9000,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316525000433","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Given a positive integer n, consider a permutation of n objects chosen uniformly at random. In this permutation, we collect maximal subsequences consisting of consecutive numbers arranged in ascending order called blocks. Each block is then merged, and after all merges, the elements of this new set are relabeled from 1 to the current number of elements. We continue to permute and merge this new set uniformly at random until only one object is left. In this paper, we investigate the distribution of , the number of permutations needed for this process to end. In particular, we find explicit asymptotic expressions for the mean value , the variance , and higher central moments, and show that satisfies a central limit theorem.
期刊介绍:
The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.