Related papers: Generalizations of the Hanoi Towers Problem
The min-max optimization problem, also known as the saddle point problem, is a classical optimization problem which is also studied in the context of zero-sum games. Given a class of objective functions, the goal is to find a value for the…
In this paper we raise a variant of a classic problem in extremal graph theory, which is motivated by a design of fractional repetition codes, a model in distributed storage systems. For any feasible positive integers $d\geq 3$, $n \geq 3$,…
We are concerned with the barotropic compressible Navier-Stokes equations on the real line. Our primary goal is to establish the global well-posedness in a critical regularity framework in the case where the initial data are small…
The goal of this paper is to settle the study of non-commutative optimal transport problems with convex regularization, in their static and finite-dimensional formulations. We consider both the balanced and unbalanced problem and show in…
This paper is devoted to the variational inequality problems. We consider two classes of problems, the first is classical constrained variational inequality and the second is the same problem with functional (inequality type) constraints.…
We study the dual of Philo's shortest line segment problem and find the optimal line segments passing through two given points, with a common endpoint, and with the other endpoints on a given line. This problem is dual, in a…
A reformulation of the Hoop Conjecture based on the concept of trapped circle is presented. The problems of severe compactness in every spatial direction, and of how to superpose the hoops with the surface of the black hole, are resolved. A…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
In this paper we study the one-dimensional Riemann problem for a new hyperbolic system of three conservation laws of Temple class. This systems it is a simplification of a recently propose system of five conservations laws by Bouchut and…
The non-perturbative solution to the strong CP problem with magnetic monopoles as originally proposed by the author is described. It is shown that the gauge orbit space with gauge potentials and gauge tranformations restricted on the space…
One of the outstanding problems of classical celestial mechanics was the restricted 3-body prob- lem, in which a planetoid of small mass is subject to the Newtonian attraction of two celestial bodies of large mass, as it occurs, for…
This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…
We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents…
Systems of identical particles with equal charge are studied under a special type of confinement. These classical particles are free to move inside some convex region S and on the boundary of it $\Omega$ (the $S^{d-1}-$ sphere, in our…
This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…
The Heesch problem 'grades' polygons that fail to tile the plane in terms of the number of layers (or corollas) of copies of it that can be formed around a central unit. We study the different topology of ' walls', which we define to be…
In this paper we define a small variation of the Taylor method and a formula for the global error of this new numerical method that allows us to keep track of the round-off error and does not require previous knowledge of the exact…
We study the following family of problems: Given a set of $n$ points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As…