RESEARCH
Publications.
Papers in computability theory and graph theory.
In preparation
Preprints
The Power of Enumerations: Calibrating Generics and Quasiminimals
Submitted
Contrasting the Halves of an Ahmad Pair
We study Ahmad pairs in the Σ02 enumeration degrees. The left halves are precisely the degrees that are low3 and join irreducible. We prove that every right half is high2. We also characterize the left halves of Ahmad n-pairs using a hierarchy of join irreducibility notions. These results have consequences for the ∀∃ theory of the local structure of the enumeration degrees.
Published
List Distinguishing Number of Power of Hypercube and Cartesian Powers of a Graph
We study list distinguishing colorings of powers of hypercubes and Cartesian powers of graphs.