Charles Kenney

collaborators

3 papers

math.CO2025

Asymptotics for Palette Sparsification from Variable Lists

Jeff Kahn, Charles Kenney

It is shown that the following holds for each $ε > 0$ . For $G$ an $n$ -vertex graph of maximum degree $D$ , lists $S_{v}$ of size $D + 1$ (for $v \in V (G)$ ), and $L_{v}$ chosen uni…

math.CO2024

Palette Sparsification via FKNP

Vikrant Ashvinkumar, Charles Kenney

A random set $S$ is $p$ -spread if, for all sets $T$ , $P (S \supseteq T) \leq p^{∣ T ∣} .$ There is a constant $C > 1$ large enough that for every graph $G$ with maximum degree…

math.NT2024

Creating Decidable Diophantine Equations

Robert Dougherty-Bliss, Charles Kenney, Doron Zeilberger

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences…