N. Lindzey

activity

20132026

most citedSpeeding Up Graph Algorithms via Switching Classes

1 citations · 2 across the 14 of their papers we have counts for

collaborators

Showing math.COShow all

12 papers · 1 filter

math.CO2026

Intersecting Families of Spanning Trees of $K_{n, n}$

Gordian C. Bruns, Dheer Noal Desai, Alexander L. Gavrilyuk +2

A family of spanning trees of a graph is $t$ -intersecting if any pair of spanning trees in the family has $t$ or more edges in common. For sufficiently large $n$ and $t \leq n/C\lo…

math.CO2026

Forbidden Intersection Theorems for Matrix Spaces

Esty Kelman, Nathan Lindzey, Ohad Sheinfeld

A family of $m \times n$ matrices $F \subseteq F_{q}^{m \times n}$ is { $(t - 1)$ -intersection-free} if $dim ker (A - B) \neq = t - 1$ for all $A, B \in F$ . A \em…

math.CO2026

An Eventown Result for Permutations

Nathan Lindzey

A family of permutations $F \subseteq S_{n}$ is even-cycle-intersecting if $σ π^{- 1}$ has an even cycle for all $σ, π \in F$ . We show that if $\mathcal{F} \subseteq…

math.CO2025

Intersecting Families of Spanning Trees

Peter Frankl, Glenn Hurlbert, Ferdinand Ihringer +4

A family $F$ of spanning trees of the complete graph on $n$ vertices $K_{n}$ is \emph{ $t$ -intersecting} if any two members have a forest on $t$ edges in common. We prove an…

math.CO2023

Jack Derangements

Nathan Lindzey

For each integer partition $λ ⊢ n$ we give a simple combinatorial expression for the sum of the Jack character $θ_{α}^{λ}$ over the integer partitions of $n$ with no singleton part…

math.CO2022

Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings

Gilad Chase, Neta Dafni, Yuval Filmus +1

We give a characterization of the largest $2$ -intersecting families of permutations of ${1, 2, \dots, n}$ and of perfect matchings of the complete graph $K_{2 n}$ for all $n \geq 2$ …

math.CO2022

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…

math.CO2020

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations

Yu Hin Au, Nathan Lindzey, Levent Tunçel

We explore some connections between association schemes and the analyses of the semidefinite programming (SDP) based convex relaxations of combinatorial optimization problems in th…

math.CO2019

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 $k$ -element set to an $n$ -element set. In particular, we give a new combinatorial formula for the spherical…

math.CO2018

Intersecting Families of Perfect Matchings

Nathan Lindzey

A family of perfect matchings of $K_{2 n}$ is $t$ - $in t er sec t in g$ if any two members share $t$ or more edges. We prove for any $t \in N$ that every $t$ -intersecting family o…

math.CO2018

Stability for Intersecting Families of Perfect Matchings

Nathan Lindzey

A family of perfect matchings of $K_{2 n}$ is $in t er sec t in g$ if any two of its members have an edge in common. It is known that if $F$ is family of intersecting perfect ma…

math.CO2014

Erdős-Ko-Rado for Perfect Matchings

Nathan Lindzey

A perfect matching of a complete graph $K_{2 n}$ is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $…

Intersecting Families of Spanning Trees of Kn,n​

Forbidden Intersection Theorems for Matrix Spaces

An Eventown Result for Permutations

Intersecting Families of Spanning Trees

Jack Derangements

Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings

Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations

On the Algebraic Combinatorics of Injections and its Applications to Injection Codes

Intersecting Families of Perfect Matchings

Stability for Intersecting Families of Perfect Matchings

Erdős-Ko-Rado for Perfect Matchings

Intersecting Families of Spanning Trees of $K_{n, n}$