Note on the union-closed sets conjecture and Reimer's average set size theorem
Kengbo Lu, Abigail Raz

TL;DR
This paper explores the relationship between Reimer's average set size theorem and the Union-Closed Sets Conjecture, presenting methods to construct counterexamples and analyzing their properties in relation to union-closed families.
Contribution
It introduces a general method to construct infinitely many counterexamples to the implication from Reimer's conditions to the abundance condition, and analyzes their properties.
Findings
Counterexamples can be constructed with any fixed lower bound on set size.
Counterexamples can be far from being union-closed.
The paper provides a framework for understanding the gap between Reimer's conditions and the union-closed property.
Abstract
The Union-Closed Sets Conjecture, often attributed to P\'eter Frankl in 1979, remains an open problem in discrete mathematics. It posits that for any finite family of sets , if the union of any two sets in the family is also in the family, then . We will refer to the underlined text as the abundance condition. In 2001, David Reimer proved that the average set size of a union-closed family must be at least . When proving this result, he showed that a family being union-closed implies that the family satisfies certain conditions, which we will refer to as the Reimer's conditions. Therefore, as seen in the context of Tim Gowers' polymath project on the Union-Closed Sets Conjecture, it is natural to ask if all families that satisfy Reimer's…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Literary, Cultural, Historical Analysis
