Group Members

Cory McCartan, Laura LeGare, Caitlin Davis.

Supervisors

Luke Rogers, Sweta Pandey.

Overview

Geodesics (shortest paths) on manifolds such as planes and spheres are well understood.  Geodesics on fractal sets such as the Sierpinski Triangle are much more complicated.  We begin by constructing algorithms for building shortest paths and provide explicit formulas for computing their lengths.  We then turn to the question of interpolation along geodesics—given two subsets of the Sierpinski Triangle, we “slide” points in one set along geodesics to the other set.  We construct a measure along the interpolated sets which formalizes a notion of the interpolation of a distribution of mass, and we prove interesting self-similarity relations about this measure.

Publication: J. Fractal Geom. 8 (2021), 117-152 doi.org/10.4171/JFG/100 arXiv:1912.06698

Presentation

Poster

 

Group Members

Luke Brown,  Giovanni E Ferrer Suarez, Karuna Sangam.

Supervisors

Gamal Mograby, Dan Kelleher, Luke Rogers, Sasha Teplyaev.

Overview

Laplacians have been well studied on post-critically finite (PCF) fractals. However, less is known about gradients on such fractals. Building on work by Teplyaev, we generalize results regarding the existence and continuity of the gradient on the standard Sierpinski Gasket to higher dimensional Sierpinski Gaskets. In particular, we find that, for functions with a continuous Laplacian, the gradient must be defined almost everywhere, and specify a set of points for which it is defined. Furthermore, we provide a counterexample on higher-dimensional Sierpinski gaskets where the Laplacian is continuous but the gradient is not defined everywhere. We conjecture that Hölder continuity of the Laplacian is a condition strong enough to guarantee that the gradient exists at each point.

Publication: arXiv:1908.10539  Fractals Vol. 28, No. 06, 2050108 (2020)

doi.org/10.1142/S0218348X2050108X

Presentation

Poster

Group Members

Stephen Loew, Madeline Hansalik, Aubrey Coffey

Supervisors

Luke Rogers, Antoni Brzoska

Overview

The diamond fractal is a fractal that is obtained in the following manner.  Start with a graph with two vertices and an edge and replace the edge with two new vertices connected to our original vertices to obtain a diamond shaped graph.   The diamond fractal is defined to be the limiting object after continuing with the edge replacement indefinitely.  In the project, the spectrum of magnetic Laplacian operators on graph approximations to the diamond fractal was computed.

Given a level n approximation to the fractal with known magnetic field strengths through cells and holes, it is possible to determine the net magnetic field through the cells and holes of the preceding graph approximations.  The spectral similarity relation between the operators on successive graph approximations was worked out, with the corresponding spectral decimation polynomial depending on the magnetic field strengths.  A poster and talk on this work was presented at the REU Mini-Symposium at UConn.

Publication: Journal of Physics A: Mathematical and Theoretical, Volume 50, Number 32

arXiv:1704.01609

Presentation

Magnetic Spectral Decimation

Poster