Enumeration of Restricted Partition Pairs and Permutation Pairs via 0-1 Tableaux
Ken Joffaniel Gonzales
TL;DR
This paper introduces a novel enumeration method for restricted permutation and partition pairs using 0-1 tableaux, extending the approach to bipartite tableaux for more complex structures.
Contribution
It develops an extended enumeration technique employing bipartite 0-1 tableaux for permutation and partition pairs with restrictions.
Findings
Effective enumeration of restricted permutation pairs
Effective enumeration of restricted partition pairs
Extension of 0-1 tableaux method to bipartite structures
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Bayesian Methods and Mixture Models