17 citations · 34 across the 9 of their papers we have counts for
10 papers
Lights Out On Nearly Complete Graphs
Bradley Forrest, Riya Goyal
We study the generalization of the game Lights Out in which the standard square grid board is replaced by a graph. We examine the probability that, when a graph is chosen uniformly…
Nullhomotopic and Generating Knight's Tours on Non-Orientable Surfaces
Bradley Forrest, Zachary Lague
We investigate closed knight's tours on Möbius strip and Klein bottle chess boards. In particular, we characterize the board dimensions that admit tours that are nullhomotopic and…
Quasisymmetries of finitely ramified Julia sets
James Belk, Bradley Forrest
We develop a theory of quasisymmetries for finitely ramified fractals, with applications to finitely ramified Julia sets. We prove that certain finitely ramified fractals admit a n…
Lights Out On A Random Graph
Bradley Forrest, Nicole Manno
We consider the generalized game Lights Out played on a graph and investigate the following question: for a given positive integer , what is the probability that a graph chosen…
Rearrangement groups of fractals
James Belk, Bradley Forrest
We construct rearrangement groups for edge replacement systems, an infinite class of groups that generalize Richard Thompson's groups F, T, and V . Rearrangement groups act by piec…
The Topology of Knight's Tours on Surfaces
Bradley Forrest, Kara Teehan
We investigate the homotopy classes of closed knight's tours on cylinders and tori. Specifically, we characterize the dimensions of cylindrical chessboards that admit closed knight…