The location of the first ascent in a 123-avoiding permutation

MaRDI QIDQ5262029zbMATH OpenFDO

Authors Samuel Connolly, Zachary Gabor, Anant P. Godbole

Publication date 9 July 2015

Full work available at URL https://arxiv.org/abs/1401.2691, http://www.emis.de/journals/INTEGERS/papers/p13/p13.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05)

Abstract: It is natural to ask, given a permutation with no three-term ascending subsequence, at what index the first ascent occurs. We shall show, using both a recursion and a bijection, that the number of 123-avoiding permutations at which the first ascent occurs at positions $k,k+1$ is given by the $k$-fold Catalan convolution $C_{n,k}$. For $1leklen$, $C_{n,k}$ is also seen to enumerate the number of 123-avoiding permutations with $n$ being in the $k$th position. Two interesting discrete probability distributions, related obliquely to the Poisson and geometric random variables, are derived as a result.

Recommendations

• Structure of random \(312\)-avoiding permutations
• The descent statistic on 123-avoiding permutations
• Patterns in random permutations avoiding the pattern 132
• Distributions of statistics over pattern-avoiding permutations
• Patterns in random permutations avoiding the pattern 321

Cited in

(3)

• Block decomposition of permutations and Schur-positivity
• Block numbers of permutations and Schur-positivity
• Shuffle squares and reverse shuffle squares

This page was built for publication: The location of the first ascent in a 123-avoiding permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262029)