https://hal.inria.fr/hal-00990492Chakraborty, SouravSouravChakrabortyChennai Mathematical Institute [Inde]On the sensitivity of cyclically-invariant Boolean functionsHAL CCSD2011[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Inria Sophia Antipolis-MÃ©diterranÃ©e / I3s, Service Ist2014-05-13 15:39:262017-09-07 01:03:382014-05-13 16:27:36enJournal articleshttps://hal.inria.fr/hal-00990492/document10.46298/dmtcs.552application/pdf1In this paper we construct a cyclically invariant Boolean function whose sensitivity is Theta(n(1/3)). This result answers two previously published questions. Turan (1984) asked if any Boolean function, invariant under some transitive group of permutations, has sensitivity Omega(root n). Kenyon and Kutin (2004) asked whether for a "nice" function the product of 0-sensitivity and 1-sensitivity is Omega(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 Omega(n(1/3)). Hence for this class of functions sensitivity and block sensitivity are polynomially related.