ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be the straight linear kk-tree with k≥1k\geq 1 and nn vertices, and let HH be the straight linear kk-tree with n+1n+1 vertices. Let rGr_G and rHr_H denote resistance distance in these graphs. Resistance increment conjecture.

lim⁡n→∞(rH(1,n+1)−rG(1,n))=6k(k+1)(2k+1).\lim_{n\rightarrow\infty}\bigl(r_H(1,n+1)-r_G(1,n)\bigr)=\frac{6}{k(k+1)(2k+1)}.

For k=2k=2, the paper proves the corresponding increment is 1/51/5 and hence the end-to-end resistance is unbounded. The formula for general kk is supported by empirical evidence and remains open.

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.