Search arXivSearch

arXiv · 1206.0503

The Sorting Index and Permutation Codes

Abstract

In the combinatorial study of the coefficients of a bivariate polynomial that generalizes both the length and the reflection length generating functions for finite Coxeter groups, Petersen introduced a new Mahonian statistic $sor$, called the sorting index. Petersen proved that the pairs of statistics $(sor,cyc)$ and $(inv,rl\textrm{-}min)$ have the same joint distribution over the symmetric group, and asked for a combinatorial proof of this fact. In answer to the question of Petersen, we observe a connection between the sorting index and the B-code of a permutation defined by Foata and Han, and we show that the bijection of Foata and Han serves the purpose of mapping $(inv,rl\textrm{-}min)$ to $(sor,cyc)$. We also give a type $B$ analogue of the Foata-Han bijection, and we derive the quidistribution of $(inv_B,{\rm Lmap_B},{\rm Rmil_B})$ and $(sor_B,{\rm Lmap_B},{\rm Cyc_B})$ over signed permutations. So we get a combinatorial interpretation of Petersen's equidistribution of $(inv_B,nmin_B)$ and $(sor_B,l_B')$. Moreover, we show that the six pairs of set-valued statistics $\rm (Cyc_B,Rmil_B)$, $\rm(Cyc_B,Lmap_B)$, $\rm(Rmil_B,Lmap_B)$, $\rm(Lmap_B,Rmil_B)$, $\rm(Lmap_B,Cyc_B)$ and $\rm(Rmil_B,Cyc_B)$ are equidistributed over signed permutations. For Coxeter groups of type $D$, Petersen showed that the two statistics $inv_D$ and $sor_D$ are equidistributed. We introduce two statistics $nmin_D$ and $\tilde{l}_D'$ for elements of $D_n$ and we prove that the two pairs of statistics $(inv_D,nmin_D)$ and $(sor_D,\tilde{l}_D')$ are equidistributed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Y. C. Chen, George Z. Gong, Jeremy J. F. Guo. 2012-06-04. The Sorting Index and Permutation Codes. https://arxiv.org/abs/1206.0503

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO