Uniquely-Wilf classes
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 avo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2019-11-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/5374/pdf |
| _version_ | 1827323748869472256 |
|---|---|
| author | Michael Albert Jinge Li |
| author_facet | Michael Albert Jinge Li |
| author_sort | Michael Albert |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:57:28Z |
| format | Article |
| id | doaj.art-75000758e03e4ed7a2a071cac47281ec |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:57:28Z |
| publishDate | 2019-11-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-75000758e03e4ed7a2a071cac47281ec2024-03-07T15:38:27ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502019-11-01Vol. 21 no. 2, Permutation...10.23638/DMTCS-21-2-75374Uniquely-Wilf classesMichael AlbertJinge LiTwo 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.https://dmtcs.episciences.org/5374/pdfmathematics - combinatoricscomputer science - discrete mathematics05a05, 05a15, 05-04 |
| spellingShingle | Michael Albert Jinge Li Uniquely-Wilf classes Discrete Mathematics & Theoretical Computer Science mathematics - combinatorics computer science - discrete mathematics 05a05, 05a15, 05-04 |
| title | Uniquely-Wilf classes |
| title_full | Uniquely-Wilf classes |
| title_fullStr | Uniquely-Wilf classes |
| title_full_unstemmed | Uniquely-Wilf classes |
| title_short | Uniquely-Wilf classes |
| title_sort | uniquely wilf classes |
| topic | mathematics - combinatorics computer science - discrete mathematics 05a05, 05a15, 05-04 |
| url | https://dmtcs.episciences.org/5374/pdf |
| work_keys_str_mv | AT michaelalbert uniquelywilfclasses AT jingeli uniquelywilfclasses |