An insertion process and a parity based equidistribution

TL;DR

This paper proves a conjecture about permutation statistics being equidistributed by introducing an insertion process that constructs a recursive involution, swapping two statistics while preserving a third.

Contribution

It provides a bijective proof of the conjecture using a novel insertion process and recursive involution on permutations.

Findings

Proves the equidistribution conjecture for permutation triples.

Introduces an insertion process that constructs a recursive involution.

Shows the involution swaps two statistics while keeping the third unchanged.

Abstract

A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates descents with odd descent tops, $S_{12}$ enumerates odd-odd adjacent pairs, and $S_{17}$ records the largest integer $i$ such that $1, 2, \dots, i$ appear in left-to-right order. In this note, we resolve this conjecture affirmatively by providing a bijective proof. We introduce an insertion process that constructs a recursive involution on $\mathfrak{S}_n$ that swaps $S_{10}$ and $S_{12}$ while keeping $S_{17}$ unchanged.