English

New Results on Doubly Adjacent Pattern-Replacement Equivalences

Combinatorics 2014-03-04 v2

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 PP of a subset of ScS_c for some cc. 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 {123,132}\{123, 132\}-equivalence, under the {123,321}\{123, 321\}-equivalence, under the {123,132,213}\{123, 132, 213\} equivalence, and under the {123,132,213,321}\{123, 132, 213, 321\}-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 S3S_3, as well as for an infinite family of other replacement partitions. In addition, we characterize the equivalence classes in SnS_n under the ScS_c-equivalence, finding a generalization of Stanley's results on the {12,21}\{12, 21\}-equivalence. To do this, we introduce a notion of confluence that often allows one to find a representative element in each equivalence class under a given equivalence relation. Using an inclusion-exclusion argument, we are able to use this to count the equivalence classes under equivalence relations satisfying certain conditions.

Keywords

Cite

@article{arxiv.1402.3881,
  title  = {New Results on Doubly Adjacent Pattern-Replacement Equivalences},
  author = {William Kuszmaul},
  journal= {arXiv preprint arXiv:1402.3881},
  year   = {2014}
}
R2 v1 2026-06-22T03:09:23.677Z