ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite connected graph, let T{\bf T} be a uniform spanning tree, let ee be an edge, and let AA be an up-event, meaning an upwardly closed event in the space of subgraphs of GG, that ignores ee, meaning that for every subgraph HH one has H∈AH\in A if and only if H∪e∈AH\cup e\in A. Negative-association conjecture.

P(A and e∈T)≤P(A)P(e∈T).{\bf P}(A\text{ and }e\in{\bf T})\leq {\bf P}(A){\bf P}(e\in{\bf T}).

This would strengthen the preceding pairwise negative-correlation theorem for edges of a uniform spanning tree. The source explicitly states that the truth or falsity of this assertion is unknown.

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.