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

DOI10.46298/DMTCS.12458zbMATH Open1547.05009MaRDI QIDQ6606911

Hannah Swickheimer, Anant Godbole

Publication date: 17 September 2024

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

zbMATH Keywords

random permutationpermutation patternsdistinct patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Title not available (Why is that?)
• Covering \(n\)-permutations with \((n+1)\)-permutations
• 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)