Classification conjecture for equal determinants of colored paths
Statement
Let ) and be two colored paths on vertices with concentration matrices and satisfying
A reflection of a colored path is the path obtained by reversing its vertex order. Colored-path determinant conjecture. If is even, then one of the following holds: is identical to ; is a reflection of ; or and satisfy the color configuration stated in the even-path theorem, or a reflection of that configuration. If is odd, then one of the following holds: is identical to ; is a reflection of ; or and satisfy the color configuration stated in the odd-path theorem, or a reflection of that configuration. The claim is presented as an unresolved conjecture based on the necessary color-multiset conditions proved earlier.
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.