2000 character limit reached
On solving basic equations over the semiring of functional digraphs (2402.16923v5)
Published 26 Feb 2024 in cs.DM and math.CO
Abstract: Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally extended to the set of univariate polynomials R[X] over R. This paper provides a polynomial time algorithm for deciding if equations of the type AX=B have solutions when A is just a single cycle and B a set of cycles of identical size. We also prove a similar complexity result for some variants of the previous equation.
- Direct product primality testing of graphs is GI-hard. Theoretical Computer Science 860, 72–83.
- Polynomial equations over finite, discrete-time dynamical systems, in: Proc. of ACRI'18, pp. 298–306.
- An algorithmic pipeline for solving equations over discrete dynamical systems modelling hypothesis on real phenomena. Journal of Computational Science 66, 101932.
- Algorithmic reconstruction of discrete dynamics. arXiv preprint arXiv:2208.08310 .
- Handbook of product graphs. volume 2. CRC press Boca Raton.
- Factorisation in the semiring of finite dynamical systems. arXiv cs.DM 2210.11270 .
- An Introduction to the Theory of Numbers. Wiley.