Nathan Chumley Lindzey


Ph.D Student (University of Waterloo) Department of Combinatorics & Optimization. I'm on an Ontario Trillium Scholarship.
M.S., Mathematics, Colorado State Unveristy, 2014.
M.S., Computer Science, Colorado State Unveristy, 2012.
B.A., Computer Science, Music, Southwestern University, 2007.

Email: My first initial followed by my last name @uwaterloo.ca
Office: MC 5129
Office hours: 1-2 Tu

Research

  • Algebra, Combinatorics, and Optimization
  • I'm studying the algebraic structure of matchings for my PhD.

    Publications

  • Gary Au, Nathan Lindzey, Levent Tunçel: Symmetries of Matchings and Semidefinite Optimization (In preparation)
  • Nathan Lindzey: A Note on Stability for Intersecting Families. Submitted
  • Nathan Lindzey: Perfect Matching Juntas. Submitted
  • Radu Curticapean, Nathan Lindzey, Jesper Nederlof: Tight Lower Bounds for Counting Hamiltonian Cycles via Matrix Rank. SODA 2018 arxiv
  • Nathan Lindzey: Erdos-Ko-Rado for Perfect Matchings. European Journal of Combinatorics 2017 arxiv
  • Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim: Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs. Information Processing Letters 2017 arxiv
  • Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinicius Fernandes dos Santos, Jeremy Spinrad, Jayme Luiz Szwarcfiter: On Recognizing Threshold Tolerance Graphs and their Complements. WG 2014, Discrete Applied Mathematics 2017
  • Nathan Lindzey, Ross M. McConnell: Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. WG 2013, SIAM Journal on Discrete Mathematics 2016 arxiv
  • Nathan Lindzey: Speeding up Graph Algorithms via Switching Classes. IWOCA 2014 arxiv

    Code

  • python implementations of various combinatorial algorithms for rep. theory of the symmetric group tableaux.tar

    Teaching

  • CO351: Network Flow Theory