Complexity of Linear Equations and Infinite Gadgets
Abstract
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely 12-complete. This implies that the split between easy and hard problems is at a different place in the Borel setting than in the case of the CSP Dichotomy.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.