Abstract
For f : {0, 1}n → {0, 1} and S ⊂ {1, 2, . . .,,n}, let J+ S(f) be the probability that, for x uniform from {0. 1}n, there is some y ϵ {0, 1}n with f(y) = 1 and x = y outside S. We are interested in estimating, for given μ(f) (:= E(f)) and m, the least possible value of max {J+ s(f): |S| = m}. A theorem of Kahn, Kalai, and Linial (KKL) gave some understanding of this issue and led to several stronger conjectures. Here we disprove a pair of conjectures from the late 80s, as follows.
| Original language | English |
|---|---|
| Journal | Theory of Computing |
| Volume | 20 |
| DOIs | |
| State | Published - 2024 |
Bibliographical note
Publisher Copyright:© 2024 Jean Bourgain, Jeff Kahn, and Gil Kalai.
Keywords
- Boolean functions
- Discrete isoperimetric inequalities
- Influence
- Trace of set-systems
- Tribes
Fingerprint
Dive into the research topics of 'Influential coalitions for boolean functions I: Constructions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver