Linda Westrick

Assistant Professor

Penn State Department of Mathematics

318B McAllister

Email: westrick@psu.edu

Research

Computability theory, especially interactions with symbolic dynamics, combinatorics, and effective descriptive set theory.

Papers

• Topological completely positive entropy is no simpler in $\mathbb Z^2$-SFTs. Linda Westrick. Preprint available. arXiv: 1904.11444.
• Borel combinatorics fail in HYP. Henry Towsner, Rose Weisshaar, and Linda Westrick. Submitted. arXiv: 2106.13330.
• A topological approach to undefinability in algebraic extensions of ℚ. Kirsten Eisenträger, Russell Miller, Caleb Springer, and Linda Westrick. Submitted. arXiv: 2010.09551.
• Completely determined Borel sets and measurability. Linda Westrick. Submitted. arXiv: 2001.01881.
• Three topological reducibilities for discontinuous functions. Adam R. Day, Rod Downey, and Linda Westrick. Submitted. arXiv: 1906.07600.
• Effectiveness for the Dual Ramsey Theorem. Damir Dzhafarov, Stephen Flood, Reed Solomon, and Linda Westrick. Notre Dame Journal of Formal Logic, Accepted 2021. arXiv: 1710.00070.
• Luzin's (N) and randomness reflection. Arno Pauly, Linda Westrick, and Liang Yu. Journal of Symbolic Logic, Accepted 2020. arXiv: 2006.07517.
• A note on the diamond operator. Linda Westrick. Computability. The Journal of the Association CiE, 10(2):107–110, 2021. arXiv: 2001.09372.
• An effective analysis of the Denjoy rank. Linda Westrick. Notre Dame Journal of Formal Logic, 61(2):245–263, 2020. URL: https://doi.org/10.1215/00294527-2020-0006, doi:10.1215/00294527-2020-0006, arXiv: 1711.00154.
• The determined property of Baire in reverse math. Eric P. Astor, Damir Dzhafarov, Antonio Montalbán, Reed Solomon, and Linda Brown Westrick. Journal of Symbolic Logic, 85(1):166–198, 2020. arXiv: 1809.03940.
• The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Barbara Csima, Damir Dzhafarov, Denis Hirschfeldt, Carl Jockusch, Reed Solomon, and Linda Brown Westrick. Computability. The Journal of the Association CiE, 8(3-4):253–263, 2019. arXiv: 1804.09809.
• Finding bases of uncountable free abelian groups is usually difficult. Noam Greenberg, Dan Turetsky, and Linda Brown Westrick. Transactions of the American Mathematical Society, 370(6):4483–4508, 2018. doi:10.1090/tran/7232, arXiv: 1709.02326.
• Weakly 2-randoms and 1-generics in Scott sets. Linda Brown Westrick. The Journal of Symbolic Logic, 83(1):392–394, 2018. doi:10.1017/jsl.2017.73, arXiv: 1711.00153.
• Dimension 1 sequences are close to randoms. Noam Greenberg, Joseph S. Miller, Alexander Shen, and Linda Brown Westrick. Theoretical Computer Science, 705:99–112, 2018. doi:10.1016/j.tcs.2017.09.031, arXiv: 1709.05266.
• Seas of squares with sizes from a $\Pi ^0_1$ set. Linda Brown Westrick. Israel Journal of Mathematics, 222(1):431–462, 2017. doi:10.1007/s11856-017-1596-6, arXiv: 1609.07411.
• Effectiveness of Hindman's Theorem for bounded sums. Damir D. Dzhafarov, Carl G. Jockusch, Jr., Reed Solomon, and Linda Brown Westrick. In Computability and complexity, volume 10010 of Lecture Notes in Comput. Sci., pages 134–142. Springer, Cham, 2017. arXiv: 1603.08249.
• Ramsey's theorem for singletons and strong computable reducibility. Damir D. Dzhafarov, Ludovic Patey, Reed Solomon, and Linda Brown Westrick. Proceedings of the American Mathematical Society, 145(3):1343–1355, 2017. doi:10.1090/proc/13315, arXiv: 1602.04481.
• A lightface analysis of the differentiability rank. Linda Brown Westrick. Journal of Symbolic Logic, 79(1):240–265, 2014. doi:10.1017/jsl.2013.23, arXiv: 1302.2975.
• Linda Brown Westrick. Computability in Ordinal Ranks and Symbolic Dynamics. PhD thesis, University of California, Berkeley, 2014.

Upcoming Invited Talks and Workshops

• Third Workshop on Digitalization and Computable Models (WDCM). Novosibirsk and Kazan, Russia/Online. June 2021.
• Plenary Talk at the Logic Colloquium, European Summer Meeting of the ASL. Poznan, Poland/Online. July 2021.
• Dagstuhl Workshop: Descriptive Set Theory and Computable Topology. November 2021.
• CIRM conference: New Directions in Computability Theory, Luminy, France. March 2022.
• AIMS Conference Series on Dynamical Systems and Differential Equations, Special Session on Fractal Geometry, Dynamical Systems, and Their Applications. Rome, 2022.
• Plenary Talk at the Panhellenic Logic Colloquium. Volos, Greece, 2022.
• Isaac Newton Institute Workshop: Computability, Complexity and Randomness (CCR). Cambridge, UK. Date TBD.

Selected past invited talks and workshops

Random fun stuff