49 citations · 86 across the 9 of their papers we have counts for
1 paper · 1 filter
Miroslav Olšák
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. Us…