Nathan Lindzey


Postdoc, The Henry and Marilyn Taub Faculty of Computer Science, Technion 2022-Present (Funded by ERC)
Postdoc, Department of Computer Science University of Colorado, Boulder 2019-2022
Ph.D., Combinatorics and Optimization, University of Waterloo 2018

News / Upcoming Talks & Workshops

I am on the job market for Tenure-Track Assistant Professorships in Math/CS Fall 2024.
CV 10/23

BIRS Workshop: "Algebraic Graph Theory and Applications" (Fall 2025)
BIRS Workshop: "Movement and Symmetry in Graphs" (November 2024)
FPSAC 2024 (July 2024)
Simons Institute: "Analysis and TCS Reunion" (July 2024)
2024 CMS Summer Meeting (Saskatoon, SK): "Erdos-Ko-Rado Combinatorics" (June 2024)
CombinaTexas 2024 (March 23-24) slides

Contact

Email: my last name followed by my first initial @ moc.liamg
Office: Taub 511 -- 10/13/23 In Texas due to Israel-Hamas Conflict
Office hours: N/A

Teaching

I am not teaching for the 2023 academic year.
Teaching Statement.

  • I was a full-time Lecturer of Computer Science at the University of Northern Colorado from 2012 to 2014 (I designed and instructed all the courses in the Computer Science curriculum).
  • During my postdoc at the University of Colorado, I taught in the (online) Applied CS Postbaccalaureate Program (I instructed and helped design the Operating Systems course).
  • I have also been a Graduate Teaching Assistant for a variety of Mathematics courses, ranging from first-year calculus to senior/first-year graduate courses in Combinatorics and Optimization.

    Research

    Algebraic Combinatorics, Discrete Harmonic Analysis, Theoretical Computer Science
    Research Statement

  • Recently I was part of the Analysis and TCS: New Frontiers research program held at the Simons Institute for the Theory of Computing.
  • Mark Wildon blogged about some of my on-going work with Ehud Friedgut and others here.
  • Gil Kalai blogged about some of my on-going work with Yuval Filmus here.

    Publications

  • w/ Esty Kelman, Ohad Sheinfeld: Forbidden Intersection Theorems for Matrix Spaces (In preparation)
  • w/ Shai Evra, Guy Kindler, Noam Lifshitz: Global Hypercontractivity for Finite Groups of Lie Type (In preparation)
  • On Products of Derangements (In preparation)
  • Disjointness Graphs FPSAC 2024, Submitted
  • Jack Derangements FPSAC 2024, Submitted
  • w/ Yuval Filmus: A Note on "Largest independent sets of certain regular subgraphs of the derangement graph" Journal of Algebraic Combinatorics (to Appear)
  • w/ Yuval Filmus: Harmonic Polynomials on Perfect Matchings FPSAC 2022
  • w/ Gilad Chase, Neta Dafni, Yuval Filmus: Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings Discrete Math Days 2022, Submitted
  • w/ Yuval Filmus: Simple Algebraic Proofs of Uniqueness for Erdös-Ko-Rado Theorems Discrete Math Days 2022, Algebraic Combinatorics (pending minor revisions)
  • w/ Neta Dafni, Yuval Filmus, Noam Lifshitz, Marc Vinyals: Complexity Measures on the Symmetric Group and Beyond ITCS 2021, Submitted
  • w/ Gary Au, Levent Tunçel: On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations Submitted
  • w/ Peter Dukes, Ferdinand Ihringer: On the Algebraic Combinatorics of Injections and its Applications to Injection Codes FPSAC 2020, IEEE Transactions on Information Theory
  • w/ Ansis Rosmanis: A Tight Lower Bound for Non-coherent Index Erasure ITCS 2020, QIC
  • Intersecting Families of Perfect Matchings Submitted
  • w/ Radu Curticapean and Jesper Nederlof: A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank SODA 2018, HALG 2018, Submitted
  • Stability for 1-Intersecting Families of Perfect Matchings European Journal of Combinatorics 2020
  • Erdos-Ko-Rado for Perfect Matchings European Journal of Combinatorics 2017
  • w/ Benson L. Joeris, Ross M. McConnell, Nissa Osheim: Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs Information Processing Letters 2017
  • w/ P.A. Golovach, P. Heggernes, R. M. McConnell, V.F. dos Santos, J. Spinrad, J.L. Szwarcfiter: On Recognizing Threshold Tolerance Graphs and their Complements. WG 2014, Discrete Applied Mathematics 2017
  • w/ Ross M. McConnell: Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. WG 2013, SIAM Journal on Discrete Mathematics 2016
  • Speeding up Graph Algorithms via Switching Classes. IWOCA 2014

    Other

  • Prison Math Project