On super-strong Wilf equivalence classes of permutations

MaRDI QIDQ1648664zbMATHFDO

Authors Demetris Hadjiloucas, Christina Savvidou, I. C. Michos

Publication date 27 June 2018

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.04014

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Wilf equivalencepatterns in permutationscluster methodgeneralized factor ordersuper-strong Wilf equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Abstract: Super-strong (elsewhere referred to as strong) Wilf equivalence is a type of Wilf equivalence on words that was introduced by Kitaev et al. 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 (Kitaev et al., 2009) that the cardinality of each Wilf equivalence class is a power of 2.

Recommendations

• Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
• New Wilf-equivalence results for vincular patterns
• Wilf equivalence relations for consecutive patterns
• A necessary condition for c-Wilf equivalence
• Uniquely-Wilf classes

Cites work

• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• A survey of consecutive patterns in permutations
• On the rearrangement conjecture for generalized factor order over \(\mathbb P\)
• Patterns in permutations and words.
• Rationality, irrationality, and Wilf equivalence in generalized factor order
• Shift equivalence in the generalized factor order

Cited in

(8)

• Operators of equivalent sorting power and related Wilf-equivalences
• Fertility, Strong Fertility, and Postorder Wilf Equivalence
• On a refinement of Wilf-equivalence for permutations
• Wilf equivalence relations for consecutive patterns
• A necessary condition for c-Wilf equivalence
• Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
• Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
• A new class of Wilf-equivalent permutations

This page was built for publication: On super-strong Wilf equivalence classes of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648664)