The Insertion Encoding of Permutations

@article{Albert2005TheIE,
  title={The Insertion Encoding of Permutations},
  author={Michael H. Albert and Steve Linton and Nikola Ruskuc},
  journal={Electr. J. Comb.},
  year={2005},
  volume={12}
}
We introduce the insertion encoding, an encoding of finite permutations. Classes of permutations whose insertion encodings form a regular language are characterized. Some necessary conditions are provided for a class of permutations to have insertion encodings that form a context free language. Applications of the insertion encoding to the evaluation of generating functions for classes of permutations, construction of polynomial time algorithms for enumerating such classes, and the illustration… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 40 citations. REVIEW CITATIONS