ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n=p+q>1n=p+q>1 be an integer. Let a⊢pa\vdash p and b⊢qb\vdash q be integer partitions, and let d=d1≥d2≥⋯≥dnd=d_1\geq d_2\geq\dots\geq d_n be their union. Let λ=λ1≥⋯≥λn−1\lambda=\lambda_1\geq\dots\geq\lambda_{n-1} be a weakly decreasing sequence of positive real numbers. For partitions and sequences of equal total sum, write ⪯\preceq for majorization, and let b∗b^* and d∗d^* denote conjugate partitions or conjugate degree sequences. The majorization-product conjecture. If

a⪯b∗andd⪯λ⪯d∗,a\preceq b^*\quad\text{and}\quad d\preceq\lambda\preceq d^*,

then

1n∏i=1n−1λi≤1pq∏i=1ndi.\frac{1}{n}\prod_{i=1}^{n-1}\lambda_i\leq\frac{1}{pq}\prod_{i=1}^n d_i.

The inequality is motivated by the spanning-tree formula in terms of the Laplacian spectrum and by the Gale--Ryser theorem and Grone--Merris theorem, which constrain the possible degree sequences and spectra. The paper explicitly calls this conjecture incorrect, and Evan Chen provided a simple counterexample to a more general conjecture; therefore this statement is refuted.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.