Exact formula and asymptotic behavior for the expected number of inversions in a random permutation avoiding a pattern of length three

Abstract

For τ∈ S3, let Sn(τ) denote the set of permutations in Sn which avoid the pattern τ, and let Enτ denote the expectation with respect to the uniformly random probability measure on Sn(τ). Let In(σ) denote the number of inversions in σ∈ Sn. We study EnτIn for τ∈\231,132,213,312\⊂ S3. We prove that En231In=En312In=12n!(n+1)!4n(2n)!-12(3n+1), and that En132In=En213In=12(n-1)n-En231In. From the first equation it follows that En231In=En312Inπ2n32. We also show that the variance VarPnτ(In) of In under Pnτ satisfies VarPnτ(In) (56-π4)n3≈ 0.048n3,\ for\ τ∈\231,132,213,312\.

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…