New Results on Doubly Adjacent Pattern-Replacement Equivalences
William Kuszmaul

TL;DR
This paper advances the understanding of pattern-replacement equivalences in permutations, solving five open problems by deriving formulas and representatives for classes, and generalizing results to broader partitions and equivalence relations.
Contribution
It provides formulas and representatives for several unresolved pattern-replacement equivalences, generalizes results to all partitions of S_3, and introduces a confluence method for class characterization.
Findings
Formulas for three of the five key equivalences.
Systems of representatives for the remaining two equivalences.
A generalized characterization of equivalence classes in S_n.
Abstract
In this paper, we consider the family of pattern-replacement equivalence relations referred to as the "indices and values adjacent" case. Each such equivalence is determined by a partition of a subset of for some . In 2010, Linton, Propp, Roby, and West posed a number of open problems in the area of pattern-replacement equivalences. Five, in particular, have remained unsolved until now, the enumeration of equivalence classes under the -equivalence, under the -equivalence, under the equivalence, and under the -equivalence. We find formulas for three of the five equivalences and systems of representatives for the equivalence classes of the other two. We generalize our results to hold for all replacement partitions of , as well as for an infinite family of other replacement partitions. In addition, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · graph theory and CDMA systems
