On the Number of Partitions of { 1, …, n} into Two Sets of Equal Cardinalities and Equal Sums

DOI10.4153/CMB-1982-034-5MaRDI QIDQ3879236zbMATH OpenFDO

Authors Helmut Prodinger

Publication date 1982

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1982-034-5

zbMATH Keywords

equal cardinalitiesnumber of partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Cited in

(3)

• Resolution of T. Ward's question and the Israel-Finch conjecture: precise analysis of an integer sequence arising in dynamics
• Fair draws for group rounds in sport tournaments
• Draw procedures for balanced 3-team group rounds in sports competitions

This page was built for publication: On the Number of Partitions of { 1, …, n} into Two Sets of Equal Cardinalities and Equal Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3879236)