ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NCn\textnormal{NC}_{n} denote the finite noncrossing matchings of order nn, let NCZ\textnormal{NC}_{\mathbb{Z}} denote the infinite noncrossing matchings, and let Π∗\Pi_* be the loop-percolation connectivity pattern. For π0∈NCn\pi_0\in\textnormal{NC}_{n}, write π0⊲Π∗\pi_0\mathrel{\lhd}\Pi_* when π0\pi_0 is a submatching of π∗\pi_*.

The rationality phenomenon for submatching events. For any π0∈NCn\pi_0\in\textnormal{NC}_{n}, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.