Pattern Avoidance for Random Permutations
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a corresponding joint distribution of independent Bernoull...
Main Authors: | Harry Crane, Stephen DeSalvo |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2018-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3213/pdf |
Similar Items
-
Bounded affine permutations I. Pattern avoidance and enumeration
by: Neal Madras, et al.
Published: (2021-03-01) -
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01) -
The permutation class Av(4213,2143)
by: David Bevan
Published: (2017-04-01) -
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
by: Colin Defant
Published: (2019-10-01) -
An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation
by: Anant Godbole, et al.
Published: (2024-05-01)