Patterns in colored circular permutations
From MaRDI portal
Publication:1639631
DOI10.2140/INVOLVE.2019.12.157zbMATH Open1391.05008OpenAlexW2808458304WikidataQ129723329 ScholiaQ129723329MaRDI QIDQ1639631FDOQ1639631
Authors: Daniel Gray, Charles Lanning, Hua Wang
Publication date: 13 June 2018
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/involve.2019.12.157
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)
Cites Work
- Dense packing of patterns in a permutation
- Combinatorics of permutations
- Asymptotic bounds for permutations containing many different patterns
- Note on superpatterns
- Pattern avoidance in coloured permutations
- Bounds on superpatterns containing all layered permutations
- Note on packing patterns in colored permutations
- Small Superpatterns for Dominance Drawing
Cited In (9)
- Counting patterns in colored orthogonal arrays
- Title not available (Why is that?)
- Coloured permutations containing and avoiding certain patterns
- Pinnacle set properties
- Title not available (Why is that?)
- Persistent Patterns in Integer Discrete Circles
- Cyclic pattern containment and avoidance
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Cyclic shuffle compatibility
This page was built for publication: Patterns in colored circular permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1639631)