\(k\)th order symmetric SAC Boolean functions and bisecting binomial coefficients (Q2387429)

A Boolean function in \(n\) variables is said to satisfy SAC if complementing any one of the \(n\) input bits results in changing the output bit with probability one half and it satisfies the SAC of order \(k\), \(0\leq k\leq n-2\), if whenever \(k\) input bits are fixed arbitrarily, the resulting function of \(n-k\) variables satisfies the SAC. In this paper, based on bisecting binomial coefficients and S. Lloyd' s work, a method to find \(k\)th order symmetric SAC functions (SSAC(\(k\))) is described. Also, all the SSAC(\(k\)) \(n\)-variable functions for \(n\leq 30\), \(k=1,2,\ldots ,n-2\) are determined and for infinitely many \(n\), some nontrivial binomial coefficient bisections are given. Note that the existence of nontrivial bisections makes the problem to find all SSAC(\(k\)) functions very difficult.