1 citations · 1 across the 6 of their papers we have counts for
9 papers
Trapping and commutative Boolean networks
Maximilien Gadouleau
A Boolean network (BN) is a transformation of the set of Boolean configurations of a given length. A trapspace of a BN is a subcube invariant by the BN; a principal trapspace is th…
On the maximum and negative frustration indices of graphs
Maximilien Gadouleau, Huiying Zeng
A signed graph is a graph with signatures ( or ) on its edges. A cycle is called positive if the product of its edge signatures is positive, and a signed graph is called ba…
Enumerating Inclusion-Maximal Arithmetic Progressions
Brian Bemman, Maximilien Gadouleau, Oliver W. Gnilke +1
We present a simple enumeration algorithm for solving a problem from mathematical and computational music analysi…
On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
Alberto Dennunzio, Maximilien Gadouleau, Luca Mariot
In this short paper, we begin to investigate the conditions under which a generic Bipermutive Cellular Automaton (BCA) with no-boundary conditions of diameter generates a Latin…
Bringing memory to Boolean networks: a unifying framework
Maximilien Gadouleau, Loïc Paulevé, Sara Riva
Boolean networks are extensively applied as models of complex dynamical systems, aiming at capturing essential features related to causality and synchronicity of the state changes…
Semirings of formal sums and injective partial transformations
Maximilien Gadouleau, Marianne Johnson
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as di…