For a bipartite graph G with X=[n], Y, and X_S=#{y\in Y:N(y)=S} for nonempty S\subset[n], define M by M_{ii}=\sum_{S:i\in S}|S| and M_{ij}=\sum_{S:i\in S, j\notin S}X_S/|S|.
Statement
For a bipartite graph G with X=[n], Y, and X_S=#{y\in Y:N(y)=S} for nonempty S\subset[n], define M by M_{ii}=\sum_{S:i\in S}|S| and M_{ij}=\sum_{S:i\in S, j\notin S}X_S/|S|. Since det(M) and det(diag(M)) are S_n-invariant polynomials in the X_S, is there a natural basis in symmetric-function theory for representing these polynomials, and is the proposed sum-of-squares refinement of their difference valid?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.