A probabilistic approach to consecutive pattern avoiding in permutations

DOI10.1016/j.jcta.2013.02.004zbMath1277.05006arXiv1208.5366OpenAlexW2088569908MaRDI QIDQ385031

Guillem Perarnau

Publication date: 29 November 2013

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

permutationsprobabilistic methodCMP conjectureconsecutive pattern avoidingmonotone patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (2)

Attacks and alignments: rooks, set partitions, and permutations ⋮ Unnamed Item

Uses Software

• CAV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A spectral approach to consecutive pattern-avoiding permutations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Consecutive patterns in permutations
• Clusters, generating functions and asymptotics for consecutive patterns in permutations
• On the number of permutations avoiding a given pattern
• Asymptotic enumeration of permutations avoiding generalized patterns
• Computational Approaches to Consecutive Pattern Avoidance in Permutations
• Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• New versions of Suen's correlation inequality

This page was built for publication: A probabilistic approach to consecutive pattern avoiding in permutations