Andrew Salmon

most citedOn the choice number of complete multipartite graphs with part size four

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

collaborators

3 papers

math.AG2023

Restricted shtukas and $Ψ$ -factorizable sheaves

Andrew Salmon

We show that Lusztig's theories of two-sided cells and non-unipotent representations of a reductive group over a finite field are compatible with the V. Lafforgue's automorphic-to-…

math.MG2022★ 7 cited

Three-point bounds for sphere packing

Henry Cohn, David de Laat, Andrew Salmon

We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a trunc…

math.CO2014★ 3 cited

On the choice number of complete multipartite graphs with part size four

H. A. Kierstead, Andrew Salmon, Ran Wang

Let $ch (G)$ denote the choice number of a graph $G$ , and let $K_{s * k}$ be the complete $k$ -partite graph with $s$ vertices in each part. Erdős, Rubin, and Taylor showed th…

Restricted shtukas and Ψ-factorizable sheaves

Three-point bounds for sphere packing

On the choice number of complete multipartite graphs with part size four

Restricted shtukas and $Ψ$ -factorizable sheaves