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

zbMATH Open1317.05011arXiv1401.2691MaRDI QIDQ5262029FDOQ5262029

Zachary Gabor, Anant P. Godbole, Samuel Connolly

Publication date: 9 July 2015

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.

Full work available at URL: https://arxiv.org/abs/1401.2691

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

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

Mathematics Subject Classification ID

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

Cited In (4)

• Block numbers of permutations and Schur-positivity
• Shuffle squares and reverse shuffle squares
• Refined restricted inversion sequences
• Block decomposition of permutations and Schur-positivity

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)