Andrew Marks

---

I'm a professor at UC Berkeley. My research interests lie in descriptive set theory and its connections to related areas such as computability theory, combinatorics, ergodic theory, probability, operator algebras, and quantum information.

Office: 733 Evans.

Email: marks@math.berkeley.edu

Publications and preprints:

1. One-ended spanning subforests and treeability of groups (with Clinton Conley, Damien Gaboriau, and Robin Tucker-Drob). Submitted [ pdf | arXiv ]
2. On a question of Slaman and Steel (with Adam Day). Submitted. [ arXiv | pdf ]
3. Descriptive graph combinatorics (with Alekos Kechris). Preprint [ pdf ].
4. Measurable graph combinatorics. Proc. Int. Cong. Math. 2022, Vol. 3, pp. 1488–1502. EMS Press, Berlin, (2023) [ pdf | doi | errata ]
5. Borel asymptotic dimension and hyperfinite equivalence relations (with Clinton Conley, Steve Jackson, Brandon Seward, and Robin Tucker-Drob). To appear in Duke Mathematical Journal [ pdf | arXiv ]
6. Distance from marker sequences in locally finite Borel graphs (with Clinton Conley) in Samuel Coskey and Grigor Sargysan eds. Trends in Set Theory, Contemp. Math. 752, (2020), 89-92 [ arXiv | pdf | doi ].
7. Measurable realizations of abstract systems of congruences (with Clinton Conley and Spencer Unger). Forum of Math, Sigma 8, (2020) e10 [ arXiv | pdf | doi ].
8. Hyperfiniteness and Borel combinatorics (with Clinton Conley, Steve Jackson, Brandon Seward, and Robin Tucker-Drob). J. European Math. Soc. 22, No. 3 (2020), 877-892 [ arXiv | pdf | doi ]
9. Folner tilings for actions of amenable groups (with Clinton Conley, Steve Jackson, David Kerr, Brandon Seward, and Robin Tucker-Drob). Mathematische Annalen 371 (2018), 663-683. [ arXiv | pdf | doi ]
10. Jump operations for Borel graphs (with Adam Day). J. Symb. Log 82 (2018), 13-28. [ arXiv | pdf | doi | errata ].
11. Borel circle squaring (with Spencer Unger). Ann. of Math. 186 (2017), 581-605. [ arXiv | pdf | doi | pictures ].
12. Uniformity, universality, and computability theory. J. Math. Logic 17 (2017) no 1. [ arXiv | pdf | doi | errata ].
13. The universality of poly-time Turing equivalence. Mathematical Structures in Computer Science (2016) [ arXiv | pdf | doi ].
14. Brooks's theorem for measurable colorings (with Clinton Conley and Robin Tucker-Drob). Forum of Math. Sigma 4 (2016) [ arXiv | pdf | doi | errata ].
15. Baire measurable paradoxical decompositions via matchings (with Spencer Unger). Adv. Math. 289 (2016), 397-410. [ arXiv | pdf | doi ].
16. A determinacy approach to Borel combinatorics. J. Amer. Math. Soc. 29 (2016), 579-600. [ arXiv | pdf | doi | errata ]
17. Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations (with Theodore Slaman and John Steel). Ordinal definability and recursion theory: The cabal seminar volume III, Lecture Notes in Logic 43, Cambridge University Press, 2016, 200-219. [ arXiv | pdf | doi | errata ]
18. Minimal Betti Numbers (with Christopher Dodd, Victor Meyerson, and Ben Richert). Communications in Algebra Vol 35 (3), 2007, pp 759-772. [ arXiv | doi ]

Seminar:

• Spring 2024 Recursion Theory/Descriptive Set Theory Seminar

Teaching notes:

• Notes on effective desciptive set theory from a course I taught in spring 2019.
• Notes on set theory from a course I taught in spring 2020 and spring 2021.
• Notes on computability theory from a course I taught in winter 2021, 2022, 2023.

Research notes (not intended for publication):

1. Larson-Zapletal's proof of Hjorth's turbulence theorm. December 2022. [ pdf ]
2. A short proof of the Connes-Feldman-Weiss theorem. November 2017. [ pdf ]
3. A Baire category proof of the Ackerman-Freer-Patel Theorem. May 2016. [ pdf ]
4. Structure in complete sections of the shift action of a residually finite group. November 2013. [ pdf ]
5. A short proof that an acyclic n-regular Borel graph may have Borel chromatic number n+1. May 2013. [ pdf ]
6. Is the Turing jump unique? : Martin's conjecture and countable Borel equivalence relations. December 2011. [ pdf ]