RESEARCH
Publications.
Papers in computability theory and graph theory.
Current projects
Joins of -pairs
Preprints
Unions of spectra and local structure spectra
The power of enumerations
Submitted
Contrasting the Halves of an Ahmad Pair
We study Ahmad pairs in the enumeration degrees. The left halves are precisely the degrees that are and join irreducible. We prove that every right half is . We also characterize the left halves of Ahmad -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
The list distinguishing number measures how many colors each vertex’s allowed list must contain to guarantee a coloring that breaks every nontrivial symmetry. We show that list restrictions do not increase the distinguishing number of Cartesian powers for connected Cartesian-prime graphs and , and determine for powers of hypercubes with and .