Unsolved
Lower-bound the spanning-tree polynomial to sharpen Gaussian \(\chi^2\) bounds
Sourced from the work of Yanjun Han, Jonathan Niles-Weed
§ Problem Statement
Setup
Unsolved Problem
§ Discussion
Loading discussion…
§ Significance & Implications
§ Known Partial Results
§ References
[1]
Approximate independence of permutation mixtures
Yanjun Han, Jonathan Niles-Weed (2024)
Annals of Statistics (to appear)
📍 Section 6.1 (Discussion: Tightness of upper bounds), unnumbered open-question paragraph immediately after the spanning-tree polynomial identity for $\tau(A)$ (no numbered conjecture/remark)
Source paper where this problem appears.