A bijective proof of an unusual symmetric group generating function

Abstract

For σ ∈ Sn, let D(σ) = \i : σi > σi+1\ denote the descent set of σ. The length of the permutation is the number of inversions, denoted by inv(σ) = | \(i,j) : i<j, σi > σj\ |. Define an unusual quadratic statisitic by baj(σ) = Σi ∈ D(σ) i (n-i). We present here a bijective proof of the identity Σσ ∈ Sn σ(n) = k qbaj(σ) - inv(σ) = Πi=1n-1 1-qi (n-i) 1-qi where k is a fixed integer.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…