6 citations · 10 across the 12 of their papers we have counts for
Showing 2008 · cs.DMShow all
2 papers · 2 filters
cs.DM2008
On the length of attractors in boolean networks with an interaction graph by layers
Adrien Richard
We consider a boolean network whose interaction graph has no circuit of length >1. Under this hypothesis, we establish an upper bound on the length of the attractors of the network…
cs.DM2008
Positive circuits and maximal number of fixed points in discrete dynamical systems
Adrien Richard
We consider the Cartesian product X of n finite intervals of integers and a map F from X to itself. As main result, we establish an upper bound on the number of fixed points for F…