On the rearrangement conjecture for generalized factor order over P

zbMATH Open1393.05019arXiv1403.5014MaRDI QIDQ4584102FDOQ4584102

Authors: Jay Pantone, Vincent Vatter 

Publication date: 29 August 2018

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

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

Recommendations

• Generating functions for Wilf equivalence under generalized factor order
• Shift equivalence in the generalized factor order
• Wilf equivalence for generalized factor orders modulo \(k\)
• A combinatorial property of the factor poset of a word
• Rationality, irrationality, and Wilf equivalence in generalized factor order

zbMATH Keywords

compositionWilf-equivalencegeneralized factor order

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited In (7)

• On super-strong Wilf equivalence classes of permutations
• A combinatorial property of the factor poset of a word
• Wilf equivalence relations for consecutive patterns
• On the centrosymmetric permutations in a class
• Generating functions for Wilf equivalence under generalized factor order
• On criteria for rook equivalence of Ferrers boards
• An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations

This page was built for publication: On the rearrangement conjecture for generalized factor order over \(\mathbb P\)

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