In this paper, we prove that the existence of absolutely continuous spectrum of the Kirchhoff Laplacian on a radial metric tree graph together with a finite complexity of the geometry of the tree implies that the tree is in fact eventually periodic. This complements the results by Breuer and Frank in (Rev Math Phys 21(7):929945, 2009) in the discrete case as well as for sparse trees in the metric case.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

We show that the inner distance inside a bounded planar domain is at most the one-dimensional Hausdorff measure of the boundary of the domain. We prove this sharp result by establishing an improved Painlevé length estimate for connected sets and by using the metric removability of totally disconnected sets, proven by Kalmykov, Kovalev, and Rajala. We also give a totally disconnected example showing that for general sets the Painlevé length bound ϰ(E)≤πH^1(E)is sharp.