A Bound on Partitioning Clusters

[摘要] Let $X$ be a finite collection of sets (or "clusters"). We consider the problem of counting the number of ways a cluster $A \in X$ can be partitioned into two disjoint clusters $A_1, A_2 \in X$, thus $A = A_1 \uplus A_2$ is the disjoint union of $A_1$ and

[学科分类] 离散数学和组合数学

[关键词] Additive energy;Hamming cube