1 citations · 1 across the 5 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2025
There is no prime functional digraph: Seifert's proof revisited
Adrien Richard
A functional digraph is a finite digraph in which each vertex has a unique out-neighbor. Considered up to isomorphism and endowed with the directed sum and product, functional digr…
math.CO2025★ 1 cited
Dividing sums of cycles in the semiring of functional digraphs
Florian Bridoux, Christophe Crespelle, Thi Ha Duong Phan +1
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed wi…
math.CO2024
Interaction graphs of isomorphic automata networks II: universal dynamics
Florian Bridoux, Aymeric Picard Marchetto, Adrien Richard
An automata network with components over a finite alphabet of size is a discrete dynamical system described by the successive iterations of a function . I…