Metrics on permutations with the same descent set

TL;DR

This paper investigates the maximum values of Hamming and ll_0-metrics on permutation subsets with fixed descent sets, providing insights into the metric structure within these combinatorial classes.

Contribution

It introduces a detailed analysis of the metric extremities on permutations sharing the same descent set, a novel focus in permutation metric research.

Findings

Determined maximum Hamming distances within descent set classes.

Identified bounds for ll_0-metric on these classes.

Provided structural insights into permutation subsets with fixed descent sets.

Abstract

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the set of all descents of $\sigma$ and define $\mathcal{D}(S;n)=\{\sigma\in S_n\, | \,\mathcal{D}(\sigma)=S\}$. We study the Hamming metric and $\ell_\infty$-metric on the sets $\mathcal{D}(S;n)$ for all possible nonempty $S\subset[n-1]$ to determine the maximum possible value that these metrics can achieve when restricted to these subsets.