Systematic counting of restricted partitions
From MaRDI portal
Publication:5148745
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".
Recommendations
Cites work
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- A variant of \texttt{IdentityFinder} and some new identities of Rogers-Ramanujan-MacMahon type
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- An invitation to the Rogers-Ramanujan identities
- Identityfinder and some new identities of Rogers-Ramanujan type
- Staircases to analytic sum-sides for many new integer partition identities of Rogers-Ramanujan type
- The Goulden—Jackson cluster method: extensions, applications and implementations
Cited in
(5)- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- scientific article; zbMATH DE number 1409240 (Why is no real title available?)
- Counting pattern-avoiding integer partitions
- Kombinatorik mit dem Computer: Partitionen und Frankaturen. (Combinatorics with the computer: partitions and the postage stamp problem)
- scientific article; zbMATH DE number 6473252 (Why is no real title available?)
Describes a project that uses
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)