Hans Parshall

collaborators

2 papers

math.CO2025

Uniquely optimal codes of low complexity are symmetric

Emily J. King, Dustin G. Mixon, Hans Parshall +1

We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predict…

math.CO2025

The ErdÅs unit distance problem for small point sets

Boris Alexeev, Dustin G. Mixon, Hans Parshall

We improve the best known upper bound on the number of edges in a unit-distance graph on $n$ vertices for each $n \in {16, \dots, 30}$ . When $n \leq 21$ , our bounds match the best kn…

Uniquely optimal codes of low complexity are symmetric

The ErdÅs unit distance problem for small point sets

The ErdÅs unit distance problem for small point sets