An alternative proof for the expected number of distinct consecutive patterns in a random permutation

DOI10.46298/DMTCS.12458MaRDI QIDQ6606911zbMATH OpenFDO

Authors Anant P. Godbole, Hannah Swickheimer

Publication date 17 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.12458

zbMATH Keywords

distinct patternspermutation patternsrandom permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• Pattern avoidance for random permutations
• On the longest common pattern contained in two or more random permutations
• A probabilistic approach to consecutive pattern avoiding in permutations
• Universality of random permutations
• Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns

Cites work

• Covering \(n\)-permutations with \((n+1)\)-permutations
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• The feasible regions for consecutive patterns of pattern-avoiding permutations
• Threshold progressions in covering and packing contexts

This page was built for publication: An alternative proof for the expected number of distinct consecutive patterns in a random permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606911)