← All problems

Forsström’s conjecture on dynamical changes of transitive Boolean functions

Let fn:{0,1}n→{0,1}f_n:\{0,1\}^n\to\{0,1\} be invariant under a transitive group of coordinate permutations, and let Xt(n)X^{(n)}_t be stationary coordinate-resampling dynamics in which each coordinate is independently resampled at rate 11 from the Bernoulli(pn)(p_n) distribution, with pn∈(0,1)p_n\in(0,1). Let CnC_n be the number of changes of fn(Xt(n))f_n(X^{(n)}_t) during t∈[0,1]t\in[0,1]. The conjecture asserts that if (Cn)(C_n) is tight, then Var⁡(fn(X0(n)))→0\operatorname{Var}(f_n(X^{(n)}_0))\to 0 as n→∞n\to\infty.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

The unrestricted conjecture is false, while a new unrefereed preprint claims the desired implication under a strong condition on the bias.

Forsström’s conjecture concerns whether dynamical instability follows from diverging expected changes for transitive Boolean functions. The unrestricted form was explicitly disproved; the latest claim addresses a restricted bias regime rather than restoring the original conjecture.

Known results

  • An explicit tame transitive sequence disproves the unrestricted conjecture (2020).
  • Counterexamples occur when npn→∞n p_n\to\infty and npnr→0n p_n^r\to 0 for some r≥2r\ge 2 (2020).
  • For regular increasing functions with bias bounded away from 00 and 11, non-tameness was proved (2020).
  • Under npn(1−pn)→∞n p_n(1-p_n)\to\infty, every sequence is o(1)o(1)-close to a volatile one (2017).

October 2026 restricted theorem

Xinyu Long’s Tameness of transitive Boolean functions claims the implication when nmin⁡(pn,1−pn)r→∞n\min(p_n,1-p_n)^r\to\infty for every fixed r>0r>0. This is a substantive restricted advance, but the preprint is unrefereed and the claim is unverified.

Current status (as of October 2026): The unrestricted conjecture is false; a restricted implication is claimed under nmin⁡(pn,1−pn)r→∞n\min(p_n,1-p_n)^r\to\infty for every fixed r>0r>0, but remains unverified.

Sources

Solutions 0

No solutions have been posted yet.