Pattern avoiding permutations are context-sensitive
Murray Elder
math.COarXiv:math/0412019
Abstract
We establish a bijection from the set of all permutations (of a given length) that avoid a pattern q and a context-sensitive language.
Create a lesson
Related papers
Elementary Proofs of Commonality of the House Graph and K4 with One Edge Subdivided
Hao Chen
Cop number of Pk-free graphs without a claw or a fork
Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain
Connectivity keeping pendant extensions of paths in k-connected triangle-free graphs
Menghan Ma, Qinghai Liu, Liping Zhang et al.
Maximal subsets of n× n board without cycles
Giedrius Alkauskas
Sequence Factory: Families of Integer Sequences Generated by Gödel Implication
Volkan Yildiz
Avoiding a partial Latin square with an isotope of a given Latin square
Stijn Cambie, Ian M. Wanless