English

Uniquely-Wilf classes

Combinatorics 2023-06-22 v3 Discrete Mathematics

Abstract

Two permutations in a class are Wilf-equivalent if, for every size, nn, the number of permutations in the class of size nn containing each of them is the same. Those infinite classes that have only one equivalence class in each size for this relation are characterised provided either that they avoid at least one permutation of size 3, or at least three permutations of size 4.

Keywords

Cite

@article{arxiv.1904.05500,
  title  = {Uniquely-Wilf classes},
  author = {Michael Albert and Jinge Li},
  journal= {arXiv preprint arXiv:1904.05500},
  year   = {2023}
}

Comments

Updated to DMTCS style