Some results on the avoidance of vincular patterns by multisets
From MaRDI portal
Publication:479044
DOI10.1016/J.DAM.2014.10.011zbMATH Open1304.05003OpenAlexW2021896245MaRDI QIDQ479044FDOQ479044
Authors: Toufik Mansour, Mark Shattuck 
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.011
Recommendations
- On avoidance of patterns of the form {\sigma}-{\tau} by words over a finite alphabet
- Avoiding a pair of patterns in multisets and compositions
- Vincular pattern avoidance on cyclic permutations
- Avoiding patterns of length three in compositions and multiset permutations
- Some Wilf-equivalences for vincular patterns
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorics of set partitions
- Words restricted by patterns with at most 2 distinct letters
- Avoiding patterns of length three in compositions and multiset permutations
- Combinatorics of Compositions and Words
- Patterns in permutations and words.
- Partially ordered generalized patterns
- Generalized pattern avoidance
- Title not available (Why is that?)
- Asymptotic enumeration of permutations avoiding generalized patterns
- Shape-Wilf-equivalences for vincular patterns
- Words restricted by 3-letter generalized multipermutation patterns
- Classification of forbidden subsequences of length 4
- Some Wilf-equivalences for vincular patterns
- On avoidance of patterns of the form {\sigma}-{\tau} by words over a finite alphabet
- New Wilf-equivalence results for vincular patterns
Cited In (3)
This page was built for publication: Some results on the avoidance of vincular patterns by multisets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479044)
