Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are interested in the number of xed points in AND-OR-NOT networks, i.e. Boolean networks in which the update function of each component is either a conjunction or a disjunction of positive or negative literals. As main result,  prove that the maximum number of xed points in a loop-less connected AND-OR-NOT network with n components is at most the maximum number of maximal independent sets in a loop-less connected graph with n vertices, a quantity already known.
['Julio Aracena', 'Adrien Richard', 'Lilian Salinas']
I am writing a research paper on a idea Maximum number of fixed points in AND–OR–NOT networks
[{"from": "human", "value": "I am writing a research paper on a idea Maximum number of fixed points in AND\u2013OR\u2013NOT networks"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are interested in the number of xed points in AND-OR-NOT networks, i.e. Boolean networks in which the update function of each component is either a conjunction or a disjunction of positive or negative literals. As main result,  prove that the maximum number of xed points in a loop-less connected AND-OR-NOT network with n components is at most the maximum number of maximal independent sets in a loop-less connected graph with n vertices, a quantity already known."}]