Butiran eJurnal
Uniquely-Wilf classes
HARVEST (oa)
oa1546842
Tarikh
2019-04-11
Pencipta
Albert, Michael
Subjek
Combinatorics; Discrete Mathematics; 05A05, 05A15, 05-04
Jenis
text
Pengenal (Identifier)
http://arxiv.org/abs/1904.05500 Discrete Mathematics & Theoretical Computer Science, Vol. 21 no. 2, Permutation Patters 2018 (November 4, 2019) dmtcs:5374; doi:10.23638/DMTCS-21-2-7
Sumber Harvest
ARXIV
Deskripsi
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.
Updated to DMTCS style