Dominance-order conjecture for permutahedron Laplacian eigenvalues

From papers

Let nn be a positive integer, let γn\gamma \vdash n range over partitions of nn, and let Λγ\Lambda_\gamma be the set of Laplacian eigenvalues associated with the isotypic component indexed by γ\gamma. Define

λ~γ:=minλΛγ{λ}.\tilde{\lambda}_\gamma:= \min_{\lambda \in \Lambda_\gamma}\{\lambda\}.

Dominance-order conjecture. If νγ\nu \vartriangleright \gamma, then

λ~ν<λ~γ.\tilde{\lambda}_\nu < \tilde{\lambda}_\gamma.

This conjectures that the smoothest eigenvectors in isotypic components earlier in the dominance ordering have strictly smaller Laplacian eigenvalues. The source provides no resolution evidence, so the conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Yilin Chen, Jennifer DeJong, Tom Halverson and David I Shuman, “Signal Processing on the Permutahedron: Tight Spectral Frames for Ranked Data Analysis”, arXiv:2103.04150 (2021).

Solutions 0

No solutions have been posted yet.