3 papers
math.CO2025
Reflexive Digraph Reconfiguration by Orientation Strings
David Emmanuel Pazmiño Pullas, Mark Siggers
The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomi…
math.CO2024
Słupecki Digraphs
Ádám Kunos, Benoit Larose, David Emmanuel Pazmiño Pullas
Call a finite relational structure -Slupecki if its only surjective -ary polymorphisms are essentially unary, and Slupecki if it is -Slupecki for all . We presen…
math.CO2022
Surjective polymorphisms of reflexive cycles
Isabelle Larivière, Benoit Larose, David Emmanuel Pazmiño Pullas
A reflexive cycle is any reflexive digraph whose underlying undirected graph is a cycle. Call a relational structure Slupecki if its surjective polymorphisms are all essentially un…