1 citations · 1 across the 4 of their papers we have counts for
7 papers
Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems
Yuval Filmus, Nathan Lindzey
We give simpler algebraic proofs of uniqueness for several Erdős-Ko-Rado results, i.e., that the canonically intersecting families are the only largest intersecting families. Using…
Complexity Measures on the Symmetric Group and Beyond
Neta Dafni, Yuval Filmus, Noam Lifshitz +2
We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decisi…
On the Algebraic Combinatorics of Injections and its Applications to Injection Codes
Peter J. Dukes, Ferdinand Ihringer, Nathan Lindzey
We consider the algebraic combinatorics of the set of injections from a -element set to an -element set. In particular, we give a new combinatorial formula for the spherical…
Intersecting Families of Perfect Matchings
Nathan Lindzey
A family of perfect matchings of is - if any two members share or more edges. We prove for any that every -intersecting family o…
Stability for Intersecting Families of Perfect Matchings
Nathan Lindzey
A family of perfect matchings of is if any two of its members have an edge in common. It is known that if is family of intersecting perfect ma…
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
For even , the matchings connectivity matrix encodes which pairs of perfect matchings on vertices form a single cycle. Cygan et al. (STOC 2013) showed that th…