On restricted permutations on regular multisets

zbMATH Open1313.05002arXiv1306.4781MaRDI QIDQ2937641FDOQ2937641

Authors: Marie-Louise Bruner 

Publication date: 9 January 2015

Abstract: The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same number of times. For this case, we close a gap in the work of Heubach and Mansour (2006) and complete the study of permutations avoiding a pair of patterns of length three. In all studied cases, closed enumeration formulae are given and well-known sequences appear. We conclude this paper by some remarks on a generalization of the Stanley-Wilf conjecture to permutations on multisets and words.

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

Recommendations

• Avoiding patterns of length three in compositions and multiset permutations
• Pattern avoidance in compositions and multiset permutations
• Pattern avoidance in multiset permutations: bijective proof
• Avoiding a pair of patterns in multisets and compositions
• A new class of multiset Wilf equivalent pairs

zbMATH Keywords

exact enumerationpermutation patternStanley-Wilf conjecturepermutation on multiset

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Cited In (1)

• Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method

This page was built for publication: On restricted permutations on regular multisets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2937641)