arXiv:1811.03923 Abstract | arXiv Analytics

arXiv:1811.03923 [math.CO]Abstract References Reviews Resources

Central limit theorems for patterns in multiset permutations and set partitions

Published 2018-11-09Version 1

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.

Comments: 36 pages

Categories: math.CO, math.PR

Keywords: central limit theorems, multiset permutations, set partitions, weighted dependency graphs, generalizes results

Related articles: Most relevant | Search more

arXiv:1502.00938 [math.CO] (Published 2015-02-03)

Central Limit Theorems for some Set Partition Statistics

Bobbie Chern, Persi Diaconis, Daniel M. Kane, Robert C. Rhoades

arXiv:1106.5036 [math.CO] (Published 2011-06-24, updated 2012-03-26)

Set partitions with no m-nesting

Marni Mishna, Lily Yen

arXiv:0910.4212 [math.CO] (Published 2009-10-22)

On Singletons and Adjacencies of Set Partitions of Type B