English

Metrics on permutations with the same descent set

Combinatorics 2024-05-13 v1

Abstract

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

Keywords

Cite

@article{arxiv.2405.06177,
  title  = {Metrics on permutations with the same descent set},
  author = {Alexander Diaz-Lopez and Kathryn Haymaker and Colin McGarry and Dylan McMahon},
  journal= {arXiv preprint arXiv:2405.06177},
  year   = {2024}
}

Comments

10 pages, 2 tables

R2 v1 2026-06-28T16:22:45.968Z