Certificate complexity and symmetry of nested canalizing functions

Yuan Li; Frank Ingram; Huaming Zhang

Certificate complexity and symmetry of nested canalizing functions

Combinatorics 2021-02-15 v2 Discrete Mathematics

Authors: Yuan Li , Frank Ingram , Huaming Zhang

Abstract

Boolean nested canalizing functions (NCFs) have important applications in molecular regulatory networks, engineering and computer science. In this paper, we study their certificate complexity. For both Boolean values $b\in\{0,1\}$ , we obtain a formula for $b$ -certificate complexity and consequently, we develop a direct proof of the certificate complexity formula of an NCF. Symmetry is another interesting property of Boolean functions and we significantly simplify the proofs of some recent theorems about partial symmetry of NCFs. We also describe the algebraic normal form of $s$ -symmetric NCFs. We obtain the general formula of the cardinality of the set of $n$ -variable $s$ -symmetric Boolean NCFs for $s=1,\dots,n$ . In particular, we enumerate the strongly asymmetric Boolean NCFs.

Cite

@article{arxiv.2102.05435,
  title  = {Certificate complexity and symmetry of nested canalizing functions},
  author = {Yuan Li and Frank Ingram and Huaming Zhang},
  journal= {arXiv preprint arXiv:2102.05435},
  year   = {2021}
}

Comments

This paper is a new version of arXiv:2001.09094. We need to resubmit it as a replacement. Otherwise, I can not finish the resubmission to the journal "Discrete Mathematics and Theoretical Computer Science"

Certificate complexity and symmetry of nested canalizing functions

Abstract

Cite

Comments

Related papers