Work

Central limit theorems for patterns in multiset permutations and set partitions

Year: 2020

Type: article

Abstract: We use the recently developed method of weighted dependency graphs to prove central limit theorems for the number of occurrences of any fixed pattern in multiset permutations and in set partitions. This generalizes results for patterns of size 2 in both settings, obtained by Canfield, Janson and Zeilberger and Chern, Diaconis, Kane and Rhoades, respectively.

Source: The Annals of Applied Probability

DOI: 10.1214/19-aap1502

Author: Valentin Féray

Institution: University of Zurich

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

Funder: Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

Award: Shifted symmetric functions