Lagrange inversion counts 35241-avoiding permutations

MaRDI QIDQ3100155zbMATH OpenFDO

Authors David Callan

Publication date 22 November 2011

Full work available at URL https://arxiv.org/abs/1104.4593, http://www.emis.de/journals/JIS/VOL14/Callan/callan2.html

IPFS 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

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

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.

Recommendations

• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Counting 1324-avoiding permutations
• Inversion formulae on permutations avoiding 321
• Forbidden subsequences
• The number of permutations avoiding a set of generalized permutation patterns

Cited in

(2)

• A combinatorial interpretation of the eigensequence for composition
• Inversion formulae on permutations avoiding 321

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Lagrange inversion counts \(3\overline5241\)-avoiding permutations

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