Related papers: Twenty-Five Moves Suffice for Rubik's Cube
In an introductory paper on dollar game played on a graph, Matt Baker wrote the following: ``The total number of borrowing moves required to win the game when playing the 'borrowing binge strategy' is independent of which borrowing moves…
We demonstrate that models trained only in simulation can be used to solve a manipulation problem of unprecedented complexity on a real robot. This is made possible by two key components: a novel algorithm, which we call automatic domain…
We study the stability and exact multiplicity of periodic solutions of the Duffing equation with cubic nonlinearities. We obtain sharp bounds for h such that the equation has exactly three ordered T-periodic solutions. Moreover, when h is…
We show that no cubic graphs of order 26 have crossing number larger than 9, which proves a conjecture of Ed Pegg Jr and Geoffrey Exoo that the smallest cubic graphs with crossing number 11 have 28 vertices. This result is achieved by first…
The rules of Sudoku are often specified using twenty seven \texttt{all\_different} constraints, referred to as the {\em big} \mrules. Using graphical proofs and exploratory logic programming, the following main and new result is obtained:…
Given a palette of six colors, a colored cube is a cube where each face is colored with exactly one color and each color appears on some face. Starting with an arbitrary collection of unit length colored cubes, one can try to arrange a…
We present three "hard" diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $\mathbb{S}^2$. Both examples are constructed by applying…
A formal n-square is the set of positions in an square matrix of size n. A shuffle of a formal n-square consists of independent rotations of each row and of each column. A key result turns out to be valid at least for n <= 34 and n = 37:…
Fast robotics pick-and-place with suction cups is a crucial component in the current development of automation in logistics (factory lines, e-commerce, etc.). By "critically fast" we mean the fastest possible movement for transporting an…
Each packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.
Exact solutions with the initial conditions are presented in the cubic duffing equation. These exact solutions are expressed in terms of the leaf function and the trigonometric function. The leaf functions: $r=sleaf_n(t) $ or $…
We introduce and analyze a model for self-reconfigurable robots made up of unit-cube modules. Compared to past models, our model aims to newly capture two important practical aspects of real-world robots. First, modules often do not occupy…
We introduce a general class of random walks on the $N$-hypercube, study cut-off for the mixing time, and provide several types of representation for the transition probabilities. We observe that for a sub-class of these processes with long…
The Cookie Monster Problem supposes that the Cookie Monster wants to empty a set of jars filled with various numbers of cookies. On each of his moves, he may choose any subset of jars and take the same number of cookies from each of those…
A solvable many-body problem in the plane is exhibited. It is characterized by rotation-invariant Newtonian (``acceleration equal force'') equations of motion, featuring one-body (``external'') and pair (``interparticle'') forces. The…
The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated. We explicitly describe the data structures…
Any $n$-tuple of points in the plane can be moved to any other $n$-tuple by a continuous motion with at most $\binom{n}{3}$ intermediate changes of the order type. Even for tuples with the same order type, the cubic bound is sharp: there…
We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.
We determine the maximal number of steps required to sort $n$ labeled points on a circle by adjacent swaps. Lower bounds for sorting by all swaps, not necessarily adjacent, are given as well.
We use cubic reciprocity to prove that the equation $7x^3+2y^3=3z^2+1$ has no integer solutions. Prior to this work, it was the shortest cubic equation for which the existence of integer solutions remained open. We conclude with a list of…