Asymptotic equivalence of tropical matrix identities for random binary words
Statement
Fix and consider words in . Choose uniformly from this set, choose uniformly from the -class of , and choose uniformly from the immediate neighbours of in that class. Random-equivalence conjecture. The probabilities
are monotone increasing in , and both tend to as .
The conjecture predicts that for long words, most identities, especially those obtained by immediate adjacent swaps, also hold in .
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.