Maximum vertex-periodicity conjecture for fractal graphs

Let KK) be one of the fractal graphs SGSG, HGHG, PGPG, MGMG, or SGCSGC, and let

m=min{i:vKi}.m=\min\{i:v\in K_i\}.

For a vertex vv, its maximum periodicity is respectively 4(3m)4(3^m) for SGSG, 2(3m)2(3^m) for HGHG, 6(5m)6(5^m) for PGPG, and 6(7m)6(7^m) for both MGMG and SGCSGC.

Maximum periodicity conjecture. The maximum periodicity of any vertex vv in each listed fractal graph is given by the corresponding value above.

The paper presents these periodicities as observations for the listed fractal graphs; no proof or resolution is supplied in the source.

Sources & referencesView supporting material

Primary source

Samantha Fairchild, Ilse Haim, Rafael G. Setra, Robert S. Strichartz and Travis Westura, “The Abelian Sandpile Model on Fractal Graphs”, arXiv:1602.03424 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.