13 citations · 15 across the 8 of their papers we have counts for
6 papers · 1 filter
FIID Coloring Random Maps
Justin Hsu, Daniel Sium, Riley Thornton
We show that the percolation components on a square grid can be -colored as a factor of iid so that neighboring components get different colors. Above the critical probability,…
Compactness Principles for CSPs and the Axiom of Chocie
Anthony Li, Ishin Shan, Matthew Snodgrass +2
We can associate a compactness principle to the Constraint Satisfaction Problem (CSP) with constraint library . These principles were studie…
Open Problems in Computability Theory and Descriptive Set Theory
George Barmpalias, Nikolay Bazhenov, Chi Tat Chong +11
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are…
An algebraic approach to Borel CSPs
Riley Thornton
We adapt tools from the algebraic approach to constraint satisfaction problems to answer descriptive set theoretic questions about Borel CSPs. We show that if a structure $\mathcal…
Effectivization in Borel Combinatorics
Riley Thornton
We develop a flexible method for showing that Borel witnesses to some combinatorial property of objects yield witnesses. We use a modification the Gandy--Harrington…
Orienting Borel Graphs
Riley Thornton
We investigate when a Borel graph admits a (Borel or measurable) orientation with outdegree bounded by for various cardinals . We show that for a p.m.p. graph , a measura…