Related papers: The Magnetic Tower of Hanoi
Matt Blum conjectured that the number of tilings of the Hexagonal Dungeon of sides $a,\ 2a,\ b,\ a,\ 2a,\ b$ (where $b\geq 2a$) is $13^{2a^2}14^{\lfloor\frac{a^2}{2}\rfloor}$ (J. Propp, New Perspectives in Geometric Combinatorics, Cambridge…
We look for observational signatures that could discriminate between Newtonian and modified Newtonian (MOND) dynamics in the Milky Way, in view of the advent of large astrometric and spectroscopic surveys. Indeed, a typical signature of…
We consider three-dimensional domino tilings of cylinders $\mathcal{R}_N = \mathcal{D} \times [0,N]$ where $\mathcal{D} \subset \mathbb{R}^2$ is a fixed quadriculated disk and $N \in \mathbb{N}$. A domino is a $2 \times 1 \times 1$ brick. A…
An inglenook puzzle is a classic shunting (switching) puzzle often found on model railway layouts. A collection of wagons sits in a fan of sidings with a limited length headshunt (lead track). The aim of the puzzle is to rearrange the…
L. Kauffman conjectured that a particular solution of the Chinese Rings puzzle is the simplest possible. We prove his conjecture by using low-dimensional topology and group theory. We notice also a surprising connection between the Chinese…
The puzzle rules for computing Schubert calculus on $d$-step flag manifolds, proven in [Knutson Tao 2003] for $1$-step, in [Buch Kresch Purbhoo Tamvakis 2016] for $2$-step, and conjectured in [Coskun Vakil 2009] for $3$-step, lead to vector…
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…
In this work, we consider the burnt pancake problem, which is a well-studied problem going back to a work of Gates and Papadimitriou from 1979.The problem is to sort a stack of~$n$ one-sided burnt pancakes of different sizes, by a sequence…
We give new algorithms for generating all n-tuples over an alphabet of m letters, changing only one letter at a time (Gray codes). These algorithms are based on the connection with variations of the Towers of Hanoi game. Our algorithms are…
Let $M_0(n)$ (resp. $M_1(n)$) denote the number of partitions of $n$ with even (reps. odd) crank. Choi, Kang and Lovejoy established an asymptotic formula for $M_0(n)-M_1(n)$. By utilizing this formula with the explicit bound, we show that…
Let $M$ be a closed orientable $(n-1)$-connected $(2n+2)$-manifold, $n\geq 2$. In this paper we combine the Postnikov tower of spheres and the homotopy decomposition of the reduced suspension space $\Sigma M$ to investigate the cohomotopy…
We investigate the transition from regular to chaotic motion in a composite galaxy model with a disk-halo, a massive dense nucleus and a dark halo component. We obtain relationships connecting the critical value of the mass of the nucleus…
Nontransitive dice are dice beating one another in a cyclic way: die A wins die B, B wins C, and C wins A (like in a rock-paper-scissors game). In this article, it has been shown that a structure of mutual wins of 3 nontransitive dice (with…
We prove that the 2017 puzzle game ZHED is NP-complete, even with just 1 tiles. Such a puzzle is defined by a set of unit-square 1 tiles in a square grid, and a target square of the grid. A move consists of selecting an unselected 1 tile…
The pancake puzzle is a classic optimization problem that has become a standard benchmark for heuristic search algorithms. In this paper, we provide full proofs regarding the local search topology of the gap heuristic for the pancake…
We investigate the quantum mechanics of the doubled torus system, introduced by Hull [1] to describe T-folds in a more geometric way. Classically, this system consists of a world-sheet Lagrangian together with some constraints, which reduce…
The rotation of multi-dimensional arrays, or tensors, is a fundamental operation in computer science with applications ranging from data processing to scientific computing. While various methods exist, achieving this rotation in-place…
Knots and links play a crucial role in understanding topology and discreteness in nature. In magnetic systems, twisted, knotted and braided vortex tubes manifest as Skyrmions, Hopfions, or screw dislocations. These complex textures are…
The 3x+ 1 problem concerns iteration of the map on the integers given by T(n) = (3n+1)/2 if n is odd; T(n) = n/2 if n is even. The 3x+1 Conjecture asserts that for every positive integer n > 1 the forward orbit of n under iteration by T…
The 30 MacMahon colored cubes have each face painted with one of six colors and every color appears on at least one face. One puzzle involving these cubes is to create a $2\times2\times2$ model with eight distinct MacMahon cubes to recreate…