Will Hardt

activity

20172025

collaborators

4 papers

math.NT2025

Smyth's conjecture and a non-deterministic Hasse principle

Jordan S. Ellenberg, Will Hardt

In a 1986 paper, Smyth proposed a conjecture about which integer-linear relations were possible among Galois-conjugate algebraic numbers. We prove this conjecture. The main tools (…

math.NT2021

Linear Relations Among Galois Conjugates Over $F_{q} (t)$

Will Hardt, John Yin

We classify the coefficients $(a_{1}, ..., a_{n}) \in F_{q} [t]^{n}$ that can appear in a linear relation $\sum_{i = 1}^{n} a_{i} γ_{i} = 0$ among Galois conjugates $γ_i \in \overline{\mathbb…

math.CO2017

Support Equalities Among Ribbon Schur Functions

Marisa Gaetz, Will Hardt, Shruthi Sridhar

In 2007, McNamara proved that two skew shapes can have the same Schur support only if they have the same number of $k \times ℓ$ rectangles as subdiagrams. This implies that two r…

math.CO2017

Packing tree degree sequences

Aravind Gollakota, William Hardt, Istvan Miklos

We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree rea…

Smyth's conjecture and a non-deterministic Hasse principle

Linear Relations Among Galois Conjugates Over Fq​(t)

Support Equalities Among Ribbon Schur Functions

Packing tree degree sequences

Linear Relations Among Galois Conjugates Over $F_{q} (t)$