On the Rearrangement Conjecture for Generalized Factor Order Over $\mathbb{P}$
Combinatorics
2014-09-15 v2
Abstract
The Rearrangement Conjecture states that if two words over are Wilf-equivalent in the factor order on then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove that if two words over are strongly Wilf-equivalent then they are rearrangements of each other. We further conjecture that Wilf-equivalence implies strong Wilf-equivalence.
Cite
@article{arxiv.1403.5014,
title = {On the Rearrangement Conjecture for Generalized Factor Order Over $\mathbb{P}$},
author = {Jay Pantone and Vincent Vatter},
journal= {arXiv preprint arXiv:1403.5014},
year = {2014}
}