Solving "pseudo-injective" polynomial equations over finite dynamical systems
By: Antonio E. Porreca, Marius Rolland
Potential Business Impact:
Breaks down hard problems into smaller, easier ones.
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X) = B$, with a constant side B, with the goal of decomposing complex behaviors into simpler systems. Taking inspiration from the characterization of injective polynomials P over dynamical systems, which is based on a condition on the lengths of limit cycles of their coefficients, we introduce a more general notion of pseudo-injectivity by relaxing this constraint. We prove that the associated equations can be solved efficiently, even in certain cases where the input is encoded in an exponentially more compact way.
Similar Papers
Dividing sums of cycles in the semiring of functional digraphs
Combinatorics
Finds patterns in how systems change over time.
Projecting dynamical systems via a support bound
Symbolic Computation
Finds simpler math rules for complex systems.
On the integrality of some P-recursive sequences
Number Theory
Finds patterns in number sequences.