1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2024
Sensitivity of -ary functions and low degree partitions of Hamming graphs
Sara Asensio, Ignacio García-Marco, Kolja Knauer
The study of complexity measures of Boolean functions led Nisan and Szegedy to state the sensitivity conjecture in 1994, claiming a polynomial relation between degree and sensitivi…
math.CO2022
Beyond symmetry in generalized Petersen graphs
Ignacio García-Marco, Kolja Knauer
A graph is a core or unretractive if all its endomorphisms are automorphisms. Well-known examples of cores include the Petersen graph and the graph of the dodecahedron -- both gene…
math.CO2021★ 1 cited
On monoid graphs
Kolja Knauer, Gil Puig i Surroca
We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type character…