The Rearrangement Conjecture - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

The Rearrangement Conjecture

Abstract

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.
Fichier principal
Vignette du fichier
dmAT0120.pdf (318.4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01207582 , version 1 (01-10-2015)

Identifiers

Cite

Jay Pantone, Vincent Vatter. The Rearrangement Conjecture. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.217-228, ⟨10.46298/dmtcs.2394⟩. ⟨hal-01207582⟩

Collections

INSMI TDS-MACS
35 View
498 Download

Altmetric

Share

Gmail Facebook X LinkedIn More