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

2010/08/24 by Ken Joffaniel M. Gonzales, Ken Joffaniel Gonzales, Gonzales, Ken Joffaniel
Computer Science · Mathematics · #05A18 (Secondary) #05A19 (Primary) 05A05 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Bayesian Methods and Mixture Models #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A05 #msc:05A18 #msc:05A19

paper · pdf · doi:10.48550/arxiv.1008.4192

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

openalex publication_date 2010/08/24 · arxiv created 2014/08/12 · arxiv updated 2014/08/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Citations

• Dually weighted Stirling-type sequences

Related

• Systematic Counting of Restricted Partitions
• Partitions, pairs of trees and Catalan numbers
• Young classes of permutations
• Some Applications of S-restricted Set Partitions
• Linked Partitions and Permutation Tableaux