The Pivotal Set of a Boolean Function

DOI10.1080/00029890.2025.2459044MaRDI QIDQ6965521zbMATH OpenFDO

Authors Raphaël Cerf

Publication date 3 July 2025

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00029890.2025.2459044

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites work

• A simple reduction from a biased measure on the discrete cube to the uniform measure
• Analysis of Boolean Functions
• Every monotone graph property has a sharp threshold
• How much are increasing sets positively correlated?
• Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis' graph connectivity theorem
• Learning Monotone Decision Trees in Polynomial Time
• Noise sensitivity of Boolean functions and applications to percolation
• Probability Inequalities for Sums of Bounded Random Variables
• Quantitative relation between noise sensitivity and influences
• Upper and lower bounds for stochastic processes. Decomposition theorems

This page was built for publication: The Pivotal Set of a Boolean Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965521)