Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Following [2], we say a family, H, of subsets of a n-element set is cancellative if A ∪ B = A ∪ C implies B = C when A, B, C ∈ H. We show how to construct cancellative families of sets with c2.54797n elements. This improves the previous best bound c2.52832n and falsifies conjectures of Erdös and Katona [3] and Bollobas [1].
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Imran Nasim, Melanie Weber
SCML 2024
Naga Ayachitula, Melissa Buco, et al.
SCC 2007