Related papers: Solving infinitary Rubik's cubes
We describe in details the nxnxn Rubik's Cube, namely a Rubik's Cube with n rotating slices in each face. Then we state and prove the "first law of Cubology", i.e. the solvability criterion, for it
The Rubik's Cube is the most popular puzzle in the world. Two of its studied aspects are God's Number, the minimum number of turns necessary to solve any state, and the first law of cubology, a solvability criterion. We modify previous…
We consider the classical geometric problem of prescribing the scalar and the boundary mean curvature in the unit ball endowed with the standard Euclidean metric. We will deal with the case of negative scalar curvature showing the existence…
We prove compactness of solutions of a fully nonlinear Yamabe problem satisfying a lower Ricci curvature bound, when the manifold is not conformally diffeomorphic to the standard sphere. This allows us to prove the existence of solutions…
We consider an infinite system of non overlapping globules undergoing Brownian motions in R^3. The term globules means that the objects we are dealing with are spherical, but with a radius which is random and time-dependent. The dynamics is…
We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…
The Rubik's cube is a famous puzzle in which faces can be moved and the corresponding movement operations define a group. We consider here a generalization to any $3$-valent map. We prove an upper bound on the size of the corresponding…
Scrambling the standard 3x3x3 Rubik's Cube corresponds to a random walk on a group containing approximately 43 quintillion elements. Viewing the random walk as a Markov chain, its mixing time determines the number of random moves required…
We prove that the number of multigraphs with vertex set $\{1, \ldots, n\}$ such that every four vertices span at most nine edges is $a^{n^2 + o(n^2)}$ where $a$ is transcendental (assuming Schanuel's conjecture from number theory). This is…
In this paper, we address a natural question at the intersection of combinatorial game theory and computational complexity: "Can a sum of simple tepid games in canonical form be intractable?" To resolve this fundamental question, we…
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…
It is well known that Rubik's cube has a set of group invariants. These values do not change if any layer was rotated, but they can change in case if some of the cubes were removed from the puzzle, mixed up and returned back. In this paper,…
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…
We define the family of {\it locally path-bounded} digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible,…
Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…
In this paper we prove that in a three-manifold with finitely many expansive ends, such that each end has a neighborhood where the curvature is bounded above by a negative constant, the Dirichlet problem at infinity is solvable, and hence…
We study just infinite algebras which remain so upon extension of scalars by arbitrary field extensions. Such rings are called stably just infinite. We show that just infinite rings over algebraically closed fields are stably just infinite…
In this paper we prove that all irrational numbers from totally real cubic number fields are well approximable by rationals (i.e. the partial quotients in the continued fraction expansion of such a number are unbounded). This settles the…
The infinite spin problem concerns the rotational behavior of total collision orbits in the $n$-body problem. It has long been known that when a solution tends to total collision then its normalized configuration curve must converge to the…