Open Access
2021 When are sequences of Boolean functions tame?
Malin P. Forsström
Author Affiliations +
Electron. Commun. Probab. 26: 1-13 (2021). DOI: 10.1214/21-ECP438

Abstract

In [10], Jonasson and Steif conjectured that no non-degenerate sequence of transitive Boolean functions (fn)n1 with limnI(fn)= could be tame (with respect to some (pn)n1). In a companion paper [5], 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= and limnnαpn=0 for some α(0,1). In this paper we show that with slightly different assumptions, the conclusion of the conjecture holds when the sequence (pn)n1 is bounded away from zero and one.

Funding Statement

Supported by the Knut and Alice Wallenberg Foundation and the European Research Council, Grant Agreement No. 682537.

Acknowledgments

The author would like to thank Gil Kalai and Jeffrey E. Steif for comments on the contents of this paper. Also, the author is grateful to an anonymous referee for the many useful comments, including suggesting several improvements of the proofs in this paper, especially to the proof of Lemma 3.2, and also for pointing out the relationship to the Majority function, now mentioned in Remark 4.2. Finally, the author is grateful to an anonymous referee on the companion paper [6], for making several interesting comments of relevance for this paper.

Citation

Download Citation

Malin P. Forsström. "When are sequences of Boolean functions tame?." Electron. Commun. Probab. 26 1 - 13, 2021. https://doi.org/10.1214/21-ECP438

Information

Received: 22 February 2021; Accepted: 3 November 2021; Published: 2021
First available in Project Euclid: 6 December 2021

Digital Object Identifier: 10.1214/21-ECP438

Subjects:
Primary: 60K99

Keywords: Boolean functions

Back to Top