Decomposition and factorisation of transients in functional graphs

DOI10.1016/J.TCS.2024.114514MaRDI QIDQ6496877zbMATH OpenFDO

Authors François Doré, Enrico Formenti, Antonio E. Porreca, Sara Riva

Publication date 6 May 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114514

zbMATH Keywords

functional graphgraph direct producttransient dynamics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Dividing permutations in the semiring of functional digraphs
• Functional graphs of polynomials over finite fields
• Decomposition of algebraic functions
• Factorisation in the semiring of finite dynamical systems
• Functional graphs

Cites work

• Grasping the connectivity of random functional graphs
• Handbook of product graphs
• MDDs boost equation solving on discrete dynamical systems
• On direct product cancellation of graphs
• On the cancellation law among finite relational structures
• Polynomial Equations over Finite, Discrete-Time Dynamical Systems
• Probability of Indecomposability of a Random Mapping Function
• The asymptotic number of attractors in the random map model
• The Expected Number of Components Under a Random Mapping Function
• The Kronecker Product of Graphs
• Zero divisors among digraphs

Cited in

(4)

• Dividing permutations in the semiring of functional digraphs
• Roots in the semiring of finite deterministic dynamical systems
• There is no prime functional digraph: Seifert's proof revisited
• On solving basic equations over the semiring of functional digraphs

This page was built for publication: Decomposition and factorisation of transients in functional graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496877)