Systematic counting of restricted partitions
From MaRDI portal
Publication:5148745
zbMATH Open1458.11145arXiv1910.08989MaRDI QIDQ5148745FDOQ5148745
Authors: Mingjia Yang, Doron Zeilberger 
Publication date: 5 February 2021
Abstract: Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of partitions avoiding an arbitrary set of "patterns".
Full work available at URL: https://arxiv.org/abs/1910.08989
Recommendations
Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Calculation of integer sequences (11Y55)
Cites Work
- Identityfinder and some new identities of Rogers-Ramanujan type
- Title not available (Why is that?)
- The Goulden—Jackson cluster method: extensions, applications and implementations
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- A variant of \texttt{IdentityFinder} and some new identities of Rogers-Ramanujan-MacMahon type
- An invitation to the Rogers-Ramanujan identities
- Staircases to analytic sum-sides for many new integer partition identities of Rogers-Ramanujan type
Cited In (5)
- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- Title not available (Why is that?)
- Counting pattern-avoiding integer partitions
- Kombinatorik mit dem Computer: Partitionen und Frankaturen. (Combinatorics with the computer: partitions and the postage stamp problem)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Systematic counting of restricted partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148745)
