REVIEW 2 cited by
An improved lower bound for the union-closed set conjecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
An improved lower bound for the union-closed set conjecture
abstract
Gilmer has recently shown that in any nonempty union-closed family $\mathcal F$ of subsets of a finite set, there exists an element contained in at least a proportion $.01$ of the sets of $\mathcal F$. We improve the proportion from $.01$ to $\frac{ 3 -\sqrt{5}}{2} \approx .38$ in this result. An improvement to $\frac{1}{2}$ would be the Frankl union-closed set conjecture. We follow Gilmer's method, replacing one key estimate by a sharp estimate. We then suggest a new addition to this method and sketch a proof that it can obtain a constant strictly greater than $\frac{ 3 -\sqrt{5}}{2} $. We also disprove a conjecture of Gilmer that would have implied the union-closed set conjecture.
Forward citations
Cited by 2 Pith papers
-
Redundancy Is All You Need (for CSP Sparsification)
For any CSP predicate R, unweighted CSP(R) instances admit sparsifiers of size at most their non-redundancy (up to polylog factors); weighted cases are pinned to chain length, via a VC-type theorem for set families us...
-
Entropy methods in combinatorics
A selective survey of entropy methods in combinatorics, detailing randomized chain rules, Shearer's inequality, random homomorphisms, Pinsker-type arguments, the union-closed sets breakthrough, and entropy approaches ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.