Adjacent-swap connectivity conjecture for binary tropical matrix identities
Statement
Let be a two-letter alphabet, let with , and let . Write when and differ by one adjacent swap, and let denote equivalence in . Adjacent-swap connectivity conjecture.
if and only if there exists a positive integer and words such that
and
The conjecture is asserted only for binary alphabets; the paper notes that it fails for alphabets of size greater than two, while it holds trivially for the previously known identities arising from a single adjacent swap.
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.