Infinite-length arcs conjecture for supermixed labyrinth fractals
Statement
Let be a sequence of collections of labyrinth patterns. For each , every pattern in is horizontally and vertically blocked, and let be the width sequence satisfying
Infinite-length arcs conjecture. The supermixed labyrinth fractal generated by has the property that, between any two distinct points in the fractal, the arc connecting them in the fractal has infinite length.
This conjecture extends the known results for mixed labyrinth fractals, where examples with both finite and infinite connecting arcs exist. It predicts that the stated divergence condition on the widths forces every connecting arc between distinct points of a supermixed labyrinth fractal to have infinite length.
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.