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".









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)