Partitions of bi-partite numbers into at most \(j\) parts

DOI10.1007/BF01271709zbMath0762.05005OpenAlexW1996766409WikidataQ105671889 ScholiaQ105671889MaRDI QIDQ1187951

Bruce M. Landman, Ezra A. Brown, Frederick J. Portier

Publication date: 3 August 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01271709

zbMATH Keywords

partitionsbi-partite numbers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Related Items (3)

Character polynomials and the restriction problem ⋮ Partitions of bipartite numbers ⋮ On highly factorable numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Number of Partitions of a Large Bi-Partite Number
• Partition of j -Partite Numbers into k Summands
• Partitions of Large Bipartites
• Asymptotic Formulæ for the Number of Partitions of a Multi-Partite Number
• An Extension of Carlitz's Bipartition Identity
• Partition of multipartite numbers into k parts.
• Vector Partitions and Combinatorial Identities
• Partition Theorems for Euler Pairs
• Some generating functions

This page was built for publication: Partitions of bi-partite numbers into at most \(j\) parts