2019/02/23 by Miroslav Olšák, Olšák, Miroslav
Computer Science · Mathematics · Engineering · #Polynomial and algebraic computation #Advanced Differential Equations and Dynamical Systems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1902.08791
We prove that an idempotent operation generates a loop from a strongly connected digraph containing directed cycles of all lengths under very mild (local) algebraic assumptions. Using the result, we reprove the existence of a weakest non-trivial idempotent equations, and that a strongly connected digraph with algebraic length 1 compatible with a Taylor term has a loop.