49 citations · 49 across the 5 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2019
Local loop lemma
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…
math.LO2018
Loop conditions with strongly connected graphs
Miroslav Olšák
We prove that the existence of a term satisfying in a general algebraic structure is equivalent to an existence of a term satisfying $t(x,x,y,y,z,…