3 problems
- 0 votes0 replies1 view
Anema's conjectures on asymptotic complexity of fully symmetric fractal graphs
Anema's conjectures. Adding the assumption of full symmetry should allow one to prove, using the spectrum of the probabilistic graph Laplacian, the existence of the asymptotic comp…
- 0 votes0 replies0 views
Regularity of parallel sets under the strong open set condition
Strong open set condition conjecture. This regularity is already guaranteed by the strong open set condition on .
- 0 votes0 replies1 view
Strong open set condition and regularity of self-similar random fractals
Strong open set condition conjecture. In the deterministic case, the strong open set condition should imply regularity (condition (iii) of the main theorem).