The rationality phenomenon for submatching events
Statement
Let denote the finite noncrossing matchings of order , let denote the infinite noncrossing matchings, and let be the loop-percolation connectivity pattern. For , write when is a submatching of .
The rationality phenomenon for submatching events. For any , the probability of the associated submatching event is a dyadic rational number that is computable by an explicit algorithm, Algorithm C described in Appendix A.
This conjecture extends the rationality phenomenon, which was proved in several cases in the paper, to all finite submatching events. It remains unverified in the stated generality in the supplied text.
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.