Pattern expansions of permutation statistics

Abstract

We study the expansions of permutation statistics in the basis of functions counting occurrences of a fixed pattern in a permutation. We show the finiteness of these pattern expansions for a class of permutation statistics including the higher moment statistics, generalizing a result of Berman and Tenner. We also give a combinatorial criterion for the positivity of pattern expansions. Using this criterion, we show that the pattern expansion of the number of reduced words of a permutation is positive and give an enumerative interpretation for the coefficients.

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…