On Super-Strong Wilf Equivalence Classes of Permutations
Keyword(s):
Super-strong Wilf equivalence is a type of Wilf equivalence on words that was originally introduced as strong Wilf equivalence by Kitaev et al. [Electron. J. Combin. 16(2)] in $2009$. We provide a necessary and sufficient condition for two permutations in $n$ letters to be super-strongly Wilf equivalent, using distances between letters within a permutation. Furthermore, we give a characterization of such equivalence classes via two-colored binary trees. This allows us to prove, in the case of super-strong Wilf equivalence, the conjecture stated in the same article by Kitaev et al. that the cardinality of each Wilf equivalence class is a power of $2$.
1977 ◽
Vol 82
(2)
◽
pp. 297-300
◽
2015 ◽
Vol 3
(1-2)
◽
pp. 88-95
◽
1984 ◽
Vol 21
(03)
◽
pp. 654-660
◽
1972 ◽
Vol 9
(02)
◽
pp. 457-461
◽
2017 ◽
Vol 38
(7)
◽
pp. 2401-2421
◽
2000 ◽
Vol 09
(08)
◽
pp. 1069-1084
◽
New Classes of Statistically Pre-Cauchy Triple Sequences of Fuzzy Numbers Defined by Orlicz Function
2018 ◽
Vol 85
(3-4)
◽
pp. 411