The tensor-product strong-graph Cartesian-product conjecture
Statement
Let and be -character separated modules. Assume that , , and are socle-multiplicity free, and let denote the strong graph. The tensor-product strong-graph Cartesian-product conjecture.
This predicts that, under the stated multiplicity-free hypotheses, tensor products combine strong graphs by Cartesian product. The source presents it as the first natural expectation and gives no resolution.
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.