When are sequences of Boolean functions tame?

Abstract

In js2006, Jonasson and Steif conjectured that no non-degenerate sequence of transitive Boolean functions (fn)n ≥ 1 with n ∞ I(fn)= ∞ could be tame (with respect to some (pn)n ≥ 1 ). In a companion paper 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, n ∞ npn = ∞ and n ∞ nα 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)n ≥ 1 is bounded away from zero and one.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…