Research Projects
Some math research I've done
[Back to Main Page]
The Number Rotation Puzzle
Imagine a rectangular grid of numbers in scrambled order. You can pick any square of numbers (of some set side length) and rotate it. The puzzle is solved when the numbers have been rearranged into increasing order via such moves. What is the strategy for solving this puzzle, provided that it can be solved?
To summarize my results: It turns out that, except for some small boards, the only solvability criteria are based in parity restrictions.
My solving algorithm involves obtaining a 3-cycle algorithm using a commutator and then
A bit of background for what motivated this project: Back in high school, I downloaded an app on my phone called Simon Tatham's Puzzles, and there was one puzzle on there called Twiddle. It didn't take too long to figure out the $3 \times 3$ board with $2 \times 2$ rotating blocks, but some of the other preset-modes taunted me, demanding to be solved.
The timeline for the evolution of the mathematical theory for this game proceeded as follows.
- (Unknown Time): Jaaps Scherphuis solves the $2 \times 3$ NRP with $2 \times 2$ rotating blocks, motivated by the fact that the group generated is a common one appearing in combination puzzles like the Rubik's Cube.
- Sep. 11, 2009: The first known resolution to the square NRP appears on the speedsolving forum, courtesy of Ravi Fernando. He finds the solvability condition, derives a solving algorithm, and bounds God's number. (Crazy fact: Ravi is the person starring in this viral video from a while ago)
- Dec. 24, 2016: I ask a question on the Puzzling Stack Exchange, hoping to get a solving strategy for some of the preset-modes from someone.
- Feb. 20, 2017: I answer my own question, solving every preset mode except for the $6 \times 6$ board with $4 \times 4$ rotating blocks.
- Jun. 30, 2018: Jaaps Scherphuis finds a 3-cycle algorithm on this mode. At last, all given modes in Simon Tatham's Twiddle are solved.
- Early Aug. 2018: I solve the NRP on square boards. I start typing up my research paper so that I can submit my work to the Regeneron STS.
- Late Aug. 2018: I discover Ravi Fernando's work. Seeing that my work was no longer so original, I am confronted with the monumental task of solving the NRP on rectangular boards. (This is much scarier than it sounds: Consider e.g. a $10 \times 11$ board with $10 \times 10$ rotating blocsk. There are two possible moves you can make, and both of them displace more than 90% of the board. How in the world do you reason about that?)
- Sep-Oct. 2018: Somehow, I did it.
- Nov. 2018: I submit my paper to the Regeneron STS.
- Jan. 22, 2019 (Day that STS Finalists are announced): I keep getting spammed by this random scam caller "Washington D.C.". It definitely had to be a scambecause my project was bad and there was no way in heck it was good enough to be a finalist project. Eventually I decide to give in. I pick up the phone and... what? I'm a finalist? Wasn't my project bad? Huh?? Wait what???
- Apr. 23 2019: I decide to send my paper to Ravi Fernando since he'd probably be interested. He points out a remarkable occurence of the exotic outer automorphism on $S_6$ that was hiding in my analysis of the $3 \times 4$ board with $3 \times 3$ rotating blocks.
Being a Regeneron Finalist was kinda surreal, and I'm still surprised that I was selected. I wrote an essay about it for a Chinese newspaper, if you're interested.
Singularly-Perturbed Phase Transition Models with Boundary Conditions
The "proper physical context" for motivating this is a bit different in $N$-dimensions, but here's a one-dimensional sort of motivation. Let's say that we have this potential energy system that has two wells, i.e. locations of low energy that we want to be at. We also call these wells phases. Going from one phase to the other is a phase transition, and it is natural to ask what is the "best" way to execute a phase transition, in the sense that the least possible amount of energy is spent.
One could imagine, for instance, travelling between two planets. It's a bit unrealistic to just "teleport" to get from one planet to the other, or even "accelerate really fast and appear at the other planet". This is because speeding up is hard. Thus, it is natural to penalize high velocity when we build a model for this sort of phase transition.
This gives rise to one possible model for the energy spent in a phase transition:
$$F_{\varepsilon}(u) := \int_a^b \varepsilon^{-1}(u(x)^2-1)^2 + \varepsilon|u'(x)|^2\,dx$$
The $(u(x)^2-1)^2$ term encourages us to stay near the phases $\pm 1$, while the $|u'(x)|^2$ term says that we don't want to go too fast. The $\varepsilon$ is a parameter, and unfortunately explaining why we choose to have an $\varepsilon^{-1}$ on one term and a $\varepsilon$ on the other would be inconvenient to explain here.
Brief Aside: The "correct space" of functions $u$ that we consider is a Sobolev Space, which you can intuitively think of as a really nice space of functions that are "continuous enough to be basically differentiable".
The big point here is that this is a plausible model for phase transitions, and particularly it happens to be a model in the Van der Waals-Cahn-Hilliard theory of phase transitions. The mathematical study of this model is crucial to justifying the model's correctness. Specifically, if it were a correct model, then we would expect that a function $u$ that minimizes the value of $F_\varepsilon(u)$ would tend to "stick to the phases" wherever possible. In particular, as $\varepsilon$ gets small, a minimizer $u$ would spend less and less time between the phases, so that "in the limit" we would expect to see an instantaneous "jump" between the phases. If th math shows that this does not happen, then the model is suspect.
Fortunately, using Gamma convergence, Modica and Sternberg show that this indeed happens. They find something called the Gamma limit of the sequence of funuctionals $F_\varepsilon$ as $\varepsilon \to 0$. Roughly speaking, the formula for this Gamma limit justifies the intuitive notion that the optimal amount of energy spent moving back and forth between two phases is a constant multiple of the number of phase transitions.
Further developments included the following:
- Fonseca and Mantegazza considered a higher order derivative, studing instead the functional
$$G_\varepsilon(u) := \int_a^b \varepsilon^{-1}(u^2-1)^2 + \varepsilon^3|u''|^2\,dx.$$
(They actually did this in $N$-dimensions, but I'm sticking to $\mathbb{R}$ for simplicity.) Basically, instead of penalizing high speed, they penalize high curvature. They found the Gamma limit for $G_\varepsilon$ under a mass constraint. It turns out that the formula for this Gamma limit is similar to the one for the original model, just with a different constant.
- Owen et al. studied the orignial model, but added boundary conditions to it. The Gamma limit that they compute under these boundary conditions is the same as the one for the original model, except with an extra term accouning for deviations at the boundary.
At last, we can talk about what I'm studying! I combined the two efforts above by adding boundary condition to the second-order model. I compute the Gamma limit for this, and found that the formula for this Gamma limit consists of two terms as in Owen et al., but also includes different constants as in Fonseca and Mantegazza's work. This work was all done successfully in one dimension, and I am currently working on extending this result to $N$ dimensions using a methodology called slicing.