Related papers: On the Closed-Form Solution to the Interior Goat P…
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformation, and for which the number of possible outcomes grows…
The problem of existence of closed knight tours for rectangular chessboards was solved by Schwenk in 1991. Last year, in 2011, DeMaio and Mathew provide an extension of this result for 3-dimensional rectangular boards. In this article, we…
In this article, we report on an exact closed-form solution for the displacement at the surface of an elastic half-space elicited by a buried point source that acts at some point underneath that surface. This is commonly referred to as the…
The problem of describing the free motions of three gravitating bodies under each others gravitational influence is one of the oldest of unsolved problems of classical mechanics. Henry Poincare proved in his dictum that due to the nature of…
The Sleeping Beauty problem is a probability riddle with no definite solution for more than two decades and its solution is of great interest in many fields of knowledge. There are two main competing solutions to the problem: the halfer…
A collection of unit cubes with integer coordinates in $\mathbb R^3$ is an animal if its union is homeomorphic to the 3-ball. Pach's animal problem asks whether any animal can be transformed to a single cube by adding or removing cubes one…
This paper mainly investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the…
We study the famous mathematical puzzle of prisoners and hats. We introduce a framework in which various variants of the problem can be formalized. We examine three particular versions of the problem (each one in fact a class of problems)…
Naz and Chaudhry [3] established multiple closed-form solutions for the basic Lucas-Uzawa model. According to Boucekkine and Ruiz-Tamarit [1] and Chilarescu [2] unique closed-form solutions exist for the basic Lucas-Uzawa model. We equate…
Despite the huge number of research into the three-body problem in physics and mathematics, the study of this problem still remains relevant both from the point of view of its broad application and taking into account its fundamental…
The Snake-in-the-Box problem is that of finding a longest induced path in an $n$-dimensional hypercube. We prove new lower bounds for the values $n\in \{11,12,13\}$. The Coil-in-the-Box problem is that of finding a longest induced cycle in…
The sine-Gordon equation is a nonlinear partial differential equation. It is known that the sine-Gordon has soliton solutions in the 1D and 2D cases, but such solutions are not known to exist in the 3D case. Several numerical solutions to…
In a previous work [I. Rodnianski and Y. Shlapentokh-Rothman, Naked Singularities for the Einstein Vacuum Equations: The Exterior Solution, arXiv:1912.08478] we constructed solutions to the Einstein vacuum equations in 3+1 dimensions which…
A {\it shadow} is an exact solution to a chaotic system of equations that remains close to a numerically computed solution for a long time, ending in a {\it glitch}. We study the distribution of shadow durations at low dimension and how…
The new method for solving the descent equations for gauge theories proposed in \cite{s} is shown to be equivalent with that based on the {\em "Russian formula"}. Moreover it allows to obtain in a closed form the expressions of the…
The Monty Hal problem is an attractive puzzle. It combines simple statement with answers that seem surprising to most audiences. The problem was thoroughly solved over two decades ago. Yet, more recent discussions indicate that the solution…
Budach's Mouse-in-an-Octant Problem (attributed to Lothar Budach in a 1980 article by van Emde Boas and Karpinski) concerns the behaviour of a very simple finite-state machine ("the mouse") moving on the integer two-dimensional grid. Its…
There is a rich history of domino tilings in two dimensions. Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what does the space of all tilings look like? These questions and…
In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. We consider the containment problem where input objects are…
Partially or totally unsolved questions in number theory and geometry especially, such as coloration problems, elementary geometric conjectures, partitions, generalized periods of a number, length of a generalized period, arithmetic and…