Lagrange Inversion Counts $3\bar{5}241$-Avoiding Permutations

zbMATH Open1234.05007arXiv1104.4593MaRDI QIDQ3100155

David Callan

Publication date: 22 November 2011

Abstract: In a previous paper, we showed that $$-avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a much simpler proof based on Lagrange inversion.

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

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

zbMATH Keywords

Lagrange inversionbarred patterneigensequence

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05)

Related Items (1)

Inversion formulae on permutations avoiding 321

Uses Software

• OEIS

This page was built for publication: Lagrange Inversion Counts $3\bar{5}241$-Avoiding Permutations

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