RESEARCH

Publications.

Papers in computability theory and graph theory.

Current projects

Current project·Computable structure theory

Double jumps of linear orders

With Julia Knight and David Gonzalez

Current project·Computability theory

Joins of 𝒦-pairs

With Mariya Soskova

Preprints

Preprint·Computable structure theory

Unions of spectra and local structure spectra

Matthew Harrison-Trainor and Karthik Ravishankar

Preprint·Computability theory

The power of enumerations

Karthik Ravishankar

Submitted

2026Submitted March 2026·Computability theory

Contrasting the Halves of an Ahmad Pair

Karthik Ravishankar

We study Ahmad pairs in the Σ20 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

2020CALDAM·Graph theory

List Distinguishing Number of pth Power of Hypercube and Cartesian Powers of a Graph

L. Sunil Chandran, Sajith Padinhatteeri, Karthik Ravi Shankar

The list distinguishing number Dl(G) 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 Gr for connected Cartesian-prime graphs and r≥3, and determine Dl(Qn[p]) for powers of hypercubes with n≥7 and p≥1.