Papers
Topics
Authors
Recent
Search
2000 character limit reached

When are sequences of Boolean functions tame?

Published 3 Dec 2020 in math.PR | (2012.01970v2)

Abstract: In \cite{js2006}, Jonasson and Steif conjectured that no non-degenerate sequence of transitive Boolean functions $ (f_n){n \geq 1}$ with $ \lim{n \to \infty} I(f_n)= \infty $ could be tame (with respect to some $ (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, $\lim{n \to \infty} np_n = \infty $ and $ \lim_{n \to \infty} n\alpha p_n = 0$ for some $ \alpha \in (0,1 ).$ In this paper we show that with slightly different assumptions, the conclusion of the conjecture holds when the sequence $(p_n)_{n \geq 1}$ is bounded away from zero and one.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.