English

When are sequences of Boolean functions tame?

Probability 2021-11-05 v2

Abstract

In \cite{js2006}, Jonasson and Steif conjectured that no non-degenerate sequence of transitive Boolean functions (fn)n1 (f_n)_{n \geq 1} with limnI(fn)= \lim_{n \to \infty} I(f_n)= \infty could be tame (with respect to some (pn)n1 (p_n)_{n \geq 1} ). In a companion paper \cite{f}, the author showed that this conjecture in its full generality is false, by providing a counter-example for the case when, at the same time, limnnpn=\lim_{n \to \infty} np_n = \infty and limnnαpn=0 \lim_{n \to \infty} n^\alpha p_n = 0 for some α(0,1). \alpha \in (0,1 ). In this paper we show that with slightly different assumptions, the conclusion of the conjecture holds when the sequence (pn)n1(p_n)_{n \geq 1} is bounded away from zero and one.

Cite

@article{arxiv.2012.01970,
  title  = {When are sequences of Boolean functions tame?},
  author = {Malin Palö Forsström},
  journal= {arXiv preprint arXiv:2012.01970},
  year   = {2021}
}

Comments

12 pages

R2 v1 2026-06-23T20:42:24.350Z