2 papers
math.CO2026
Finite combinatorics and computability theory
Damir D. Dzhafarov, Jun le Goh
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reform…
math.LO2025
The tree pigeonhole principle in the Weihrauch degrees
Damir Dzhafarov, Reed Solomon, Manlio Valenti
We study versions of the tree pigeonhole principle, , in the context of Weihrauch-style computable analysis. The principle has previously been the subject of extensi…