Indexed metadata

Tameness of transitive Boolean functions

Xinyu Long

Source record

Source: arXiv

Published: Oct 7, 2026

arXiv: 2610.09725

Open original source ↗

Source abstract

Let fn:{0,1}n→{0,1}f_n:\{0,1\}^n\to\{0,1\} be Boolean functions, and let CnC_n count their changes in a unit time interval under stationary dynamics in which each coordinate is independently resampled at rate one from the Bernoulli(pn)(p_n) distribution. We prove that, if fnf_n is transitive and nmin⁡{pn,1−pn}r→∞n\min\{p_n,1-p_n\}^{r}\to\infty for every r>0r>0, then tightness of (Cn)(C_n) implies Var(fn)→0\mathrm{Var}(f_n)\to0. This settles Forsström's conjecture in the pn≤1/2p_n\le 1/2 regime and extends it symmetrically to arbitrary biases. The proof uses a mixed jump sum whose second moment is bounded by the generator of a low degree Fourier projection.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Tameness of transitive Boolean functions — Mathematical Frontier Network