{"title":"用潜在的斐波那契卷积排序1-差排列","authors":"Hosam Mahmoud","doi":"10.1007/s00010-024-01146-1","DOIUrl":null,"url":null,"abstract":"<div><p>We discuss some combinatorics associated with 1-away permutations, where an element can be displaced from its correct position by at most one location. Specifically, we look at a sorting algorithm for such permutations and analyze its number of comparisons, <span>\\(C_n\\)</span>. We find that the mean is a certain combination of two-fold convolutions of Fibonacci numbers and the variance is a certain combination of three-fold convolutions of Fibonacci numbers, with corresponding asymptotics (as <span>\\(n\\rightarrow \\infty \\)</span>): </p><div><div><span>$${\\mathbb {E}}[C_n] \\sim \\frac{5 + \\sqrt{5}}{10}\\, n, \\qquad {\\mathbb {V}\\textrm{ar}}[C_n]\\sim \\frac{\\sqrt{5}}{25} \\, n.$$</span></div></div><p>The proofs contain finer asymptotics down to exponentially small error terms. The relatively small variance admits a weak law and a central limit theorem via a super moment generating function. In view of the special nature of the data, such a specialized algorithm outperforms general comparison-based sorting algorithms.</p></div>","PeriodicalId":55611,"journal":{"name":"Aequationes Mathematicae","volume":"99 3","pages":"1209 - 1219"},"PeriodicalIF":0.9000,"publicationDate":"2025-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00010-024-01146-1.pdf","citationCount":"0","resultStr":"{\"title\":\"Sorting 1-away permutations with underlying Fibonacci convolutions\",\"authors\":\"Hosam Mahmoud\",\"doi\":\"10.1007/s00010-024-01146-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We discuss some combinatorics associated with 1-away permutations, where an element can be displaced from its correct position by at most one location. Specifically, we look at a sorting algorithm for such permutations and analyze its number of comparisons, <span>\\\\(C_n\\\\)</span>. We find that the mean is a certain combination of two-fold convolutions of Fibonacci numbers and the variance is a certain combination of three-fold convolutions of Fibonacci numbers, with corresponding asymptotics (as <span>\\\\(n\\\\rightarrow \\\\infty \\\\)</span>): </p><div><div><span>$${\\\\mathbb {E}}[C_n] \\\\sim \\\\frac{5 + \\\\sqrt{5}}{10}\\\\, n, \\\\qquad {\\\\mathbb {V}\\\\textrm{ar}}[C_n]\\\\sim \\\\frac{\\\\sqrt{5}}{25} \\\\, n.$$</span></div></div><p>The proofs contain finer asymptotics down to exponentially small error terms. The relatively small variance admits a weak law and a central limit theorem via a super moment generating function. In view of the special nature of the data, such a specialized algorithm outperforms general comparison-based sorting algorithms.</p></div>\",\"PeriodicalId\":55611,\"journal\":{\"name\":\"Aequationes Mathematicae\",\"volume\":\"99 3\",\"pages\":\"1209 - 1219\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-01-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00010-024-01146-1.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Aequationes Mathematicae\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00010-024-01146-1\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aequationes Mathematicae","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00010-024-01146-1","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
Sorting 1-away permutations with underlying Fibonacci convolutions
We discuss some combinatorics associated with 1-away permutations, where an element can be displaced from its correct position by at most one location. Specifically, we look at a sorting algorithm for such permutations and analyze its number of comparisons, \(C_n\). We find that the mean is a certain combination of two-fold convolutions of Fibonacci numbers and the variance is a certain combination of three-fold convolutions of Fibonacci numbers, with corresponding asymptotics (as \(n\rightarrow \infty \)):
The proofs contain finer asymptotics down to exponentially small error terms. The relatively small variance admits a weak law and a central limit theorem via a super moment generating function. In view of the special nature of the data, such a specialized algorithm outperforms general comparison-based sorting algorithms.
期刊介绍:
aequationes mathematicae is an international journal of pure and applied mathematics, which emphasizes functional equations, dynamical systems, iteration theory, combinatorics, and geometry. The journal publishes research papers, reports of meetings, and bibliographies. High quality survey articles are an especially welcome feature. In addition, summaries of recent developments and research in the field are published rapidly.