On the Sensitivity of Cyclically-Invariant Boolean Functions
Chakraborty, Sourav
Original · EN
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n¹/³). This result answers two previously published questions. Turán (1984) asked if any Boolean function, invariant under some transitive group of permutations, has sensitivity Ω(√n). Kenyon and Kutin (2004) asked whether for a ``nice'' function the product of 0-sensitivity and 1-sensitivity is Ω(n). Our function answers both questions in the negative. We also prove that for minterm-transitive functions (a natural class of Boolean functions including our example) the sensitivity is Ω(n¹/³). Hence for this class of functions sensitivity and block sensitivity are polynomially related.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.