activity
20062026
most citedMutually Orthogonal Latin Squares based on Cellular Automata

24 citations · 130 across the 60 of their papers we have counts for

collaborators

74 papers

cs.DM2026

Solving polynomial equations over partial discrete dynamical systems

Maximilien Gadouleau, Sara Riva, Marius Rolland +1

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviours. If the conditions are ideal and the number of observations…

math.CO2026

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…

cs.DS2026

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…

cs.FL2026

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…

cs.DM2026

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…

math.RA2026

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…