On nearly self-conjugate partitions of a finite set

DOI10.1016/S0012-365X(94)00066-RzbMath0892.05005OpenAlexW1990092166MaRDI QIDQ1377761

Honghui Wan

Publication date: 19 July 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(94)00066-r

zbMATH Keywords

set partitionsGale-Ryser theoremconjugate partitions

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05)

Related Items (2)

Nearly self-conjugate integer partitions ⋮ Algorithms for computing lengths of chains in integral partition lattices.

Cites Work

• A theorem on flows in networks
• On the number of tournaments with prescribed score vector
• A test for conjugacy of partitions of finite sets
• Combinatorial Properties of Matrices of Zeros and Ones
• On partitions of a finite set
• Unnamed Item
• Unnamed Item

This page was built for publication: On nearly self-conjugate partitions of a finite set