arXiv Analytics

Sign in

arXiv:1008.4192 [math.CO]AbstractReferencesReviewsResources

Enumeration of Restricted Partition Pairs and Permutation Pairs via 0-1 Tableaux

Ken Joffaniel Gonzales

Published 2010-08-25, updated 2014-08-12Version 5

We use the 0-1 tableaux as a tool for enumerating permutations and partitions with restricted minima. The method used is extended for permutation pairs and partition pairs generated by a bipartite 0-1 tableaux.

Comments: This paper has been withdrawn. This results of this paper has since been expanded to the preprint arXiv:1302.4694. The said paper now appears in European J. Combin
Categories: math.CO
Subjects: 05A19, 05A05, 05A18
Related articles: Most relevant | Search more
arXiv:1301.5080 [math.CO] (Published 2013-01-22, updated 2013-09-27)
Approaches for enumerating permutations with a prescribed number of occurrences of patterns
arXiv:1206.3183 [math.CO] (Published 2012-06-14)
The enumeration of three pattern classes
arXiv:math/0110030 [math.CO] (Published 2001-10-02)
Free cumulants and enumeration of connected partitions

Links

Toolbox