arXiv Analytics

Sign in

arXiv:1112.6014 [math.CO]AbstractReferencesReviewsResources

Inversion polynomials for 321-avoiding permutations

Szu-En Cheng, Sergi Elizalde, Anisse Kasraoui, Bruce Sagan

Published 2011-12-27, updated 2012-11-20Version 3

We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin paths, polyominoes, and continued fractions.

Comments: This new version is in its final state with added exposition, examples, and results
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi
arXiv:math/0502504 [math.CO] (Published 2005-02-23)
On the Wilf-Stanley limit of 4231-avoiding permutations and a conjecture of Arratia
arXiv:1012.2545 [math.CO] (Published 2010-12-12)
Proof of Andrews' conjecture on a_4φ_3 summation

Links

Toolbox