On the Rearrangement Conjecture for Generalized Factor Order Over P\mathbb{P}

preprint2014arXivOpen access

Abstract

The Rearrangement Conjecture states that if two words over P\mathbb{P} are Wilf-equivalent in the factor order on P∗\mathbb{P}^\ast then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove that if two words over P\mathbb{P} are strongly Wilf-equivalent then they are rearrangements of each other. We further conjecture that Wilf-equivalence implies strong Wilf-equivalence.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.