Sign in
Uniquely-Wilf classes
Journal article   Peer reviewed

Uniquely-Wilf classes

Michael Albert and Jinge Li
Discrete mathematics and theoretical computer science, Vol.21(2), pp.1-11
01/11/2019

Abstract

Computer science Equivalence Permutations
Two permutations in a class are Wilf-equivalent if, for every size, n, the number of permutations in the class of size n 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.

Metrics

1 Record Views

Details

Usage Policy