Related papers: On the Closed-Form Solution to the Interior Goat P…
We present a general solution and formulation framework to Bellman's lost-in-a-forest problem. The forest boundary is known and may take any shape. The starting point and the orientation are unspecified. We convert the problem into…
We propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in input a basic feasible solution and is composed by two main…
The curse of dimensionality in the realm of association rules is twofold. Firstly, we have the well known exponential increase in computational complexity with increasing item set size. Secondly, there is a \emph{related curse} concerned…
The objective of this article is to introduce a novel technique for computing numerical solutions to the nonlinear inverse heat conduction problem. This involves solving nonlinear parabolic equations with Cauchy data provided on one side…
In this paper we review nine previous proposed and solved problems of elementary 2D geometry, and we extend them either from triangles to polygons or polyhedrons, or from circles to spheres (from 2D-space to 3D-space) and make some…
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values…
This paper attempts to explain the mystery behind an 18th elephant that appears in many popular legends involving the division of a herd of 17 elephants into groups in the ratio 1/2:1/3:1/9.
We consider systems of interacting bosons confined to one-dimensional harmonic traps. In the limit of perturbatively weak two-body interactions the system exhibits several universal states that are exact solutions for a large class of…
Infinite dimensional moment problems have a long history in diverse applied areas dealing with the analysis of complex systems but progress is hindered by the lack of a general understanding of the mathematical structure behind them.…
A fundamental relation in celestial mechanics is Kepler's equation, linking an orbit's mean anomaly to its eccentric anomaly and eccentricity. Being transcendental, the equation cannot be directly solved for eccentric anomaly by…
Asking questions is a pervasive human activity, but little is understood about what makes them difficult to answer. An analysis of a pair of large databases, of New York Times crosswords and questions from the quiz-show Jeopardy,…
We received a solution of the shadow problem in n-dimensional Euclidean space for a family of sets, constructing from any convex domain having nonempty interior with the help of parallel translations and homotheties. We find a number of…
We present a numerical scheme for solving the time-independent nonlinear Gross-Pitaevskii equation in two dimensions describing the Bose-Einstein condensate of trapped interacting neutral atoms at zero temperature. The trap potential is…
In "Unsolved Problems in Number Theory" problem D22 Richard Guy asked for the existence of simplices with integer lengths, areas, volumes... In dimension two this is well known, these triangles are called Heron triangles. Here I will…
In this small paper we bring together various open problems on geometric multidimensional continued fractions.
A numerical method for coupled 3D-1D problems with discontinuous solutions at the interfaces is derived and discussed. This extends a previous work on the subject where only continuous solutions were considered. Thanks to properly defined…
We propose a new kind of sliding-block puzzle, called Gourds, where the objective is to rearrange 1 x 2 pieces on a hexagonal grid board of 2n + 1 cells with n pieces, using sliding, turning and pivoting moves. This puzzle has a single…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…
We show the closed-form solution to the maximization of trace(A'R), where A is given and R is unknown rotation matrix. This problem occurs in many computer vision tasks involving optimal rotation matrix estimation. The solution has been…
The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…