Jay Pantone ; Vincent Vatter - The Rearrangement Conjecture

dmtcs:2394 - Discrete Mathematics & Theoretical Computer Science, January 1, 2014, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) - https://doi.org/10.46298/dmtcs.2394
The Rearrangement ConjectureArticle

Authors: Jay Pantone 1; Vincent Vatter 1

  • 1 Department of Mathematics [Gainesville]

The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\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 $\mathbb{P}$ are strongly Wilf-equivalent then they are rearrangements of each other. We further conjecture that Wilf-equivalence implies strong Wilf-equivalence.


Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Section: Proceedings
Published on: January 1, 2014
Imported on: November 21, 2016
Keywords: composition,generalized factor order,Wilf-equivalence,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
Funding:
    Source : OpenAIRE Graph
  • The Structure of Permutation Classes; Funder: National Science Foundation; Code: 1301692

2 Documents citing this article

Consultation statistics

This page has been seen 218 times.
This article's PDF has been downloaded 172 times.