Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution

DOI10.1016/j.aam.2016.04.002zbMath1358.05008arXiv1604.04766OpenAlexW2963684686MaRDI QIDQ281902

Anthony Labarre, Simona Grusea

Publication date: 11 May 2016

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.04766

zbMATH Keywords

distributionasymptotic normalitydistancepermutationcombinatorial proofsprefix exchangestar posetWhitney numbers

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (2)

Sorting on graphs by adjacent swaps using permutation groups ⋮ Central limit theorem for the prefix exchange distance under Ewens sampling formula

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian limiting distributions for the number of components in combinatorial structures
• Patterns in permutations and words.
• Whitney numbers of the second kind for the star poset
• On the Whitney numbers of the second kind for the star poset
• Some topological properties of star graphs: The surface area and volume
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Central and local limit theorems applied to asymptotic enumeration
• The asymptotic expansion of a ratio of gamma functions
• Combinatorics of Permutations
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution