combinatorics / Mathematical neuroscience
The target-free clique conjecture asserts that the supports of stable fixed points of a nondegenerate combinatorial threshold-linear network are exactly its target-free cliques, the bidirected cliques no outside vertex receives an edge from every member of. An explicit six-neuron counterexample refutes it.
Temporal state
No reconciled state yet.
Append-only history
The target-free clique conjecture asserts that the supports of stable fixed points of a nondegenerate combinatorial threshold-linear network are exactly its target-free cliques, the bidirected cliques no outside vertex receives an edge from every member of. An explicit six-neuron counterexample refutes it.
Research memory
The target-free clique conjecture asserts that the supports of stable fixed points of a nondegenerate combinatorial threshold-linear network are exactly its target-free cliques, the bidirected cliques no outside vertex receives an edge from every member of. An explicit six-neuron counterexample refutes it.
Evidence graph
No public relationships recorded yet.