Branching component graph product conjecture for horizontally concatenated partitions
Statement
Let and be partitions. Write for the number of parts of and for the multiplicity of in . Suppose that . Let be their horizontal concatenation, defined by
Branching component graph product conjecture. The branching component graph satisfies
where is the directed graph product, and the vertex is labeled by . The surrounding discussion states that the vertex and weight assertions are proved, while the edge properties are conjectural; this product statement is included as part of that conjectural structure.
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.