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 with could be tame (with respect to some ). 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, and for some In this paper we show that with slightly different assumptions, the conclusion of the conjecture holds when the sequence 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