相关论文: Generalizations of the Hanoi Towers Problem
The Magnetic Tower of Hanoi puzzle - a modified "base 3" version of the classical Tower of Hanoi puzzle as described in earlier papers, is actually a small set of independent sister-puzzles, depending on the "pre-coloring" combination of…
A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…
Considering the symmetries and self similarity properties of the corresponding labeled graphs, it is shown that the minimal number of moves in the Tower of Hanoi game with $p =4$ pegs and $n \geq p$ disks satisfies the recursive formula $…
We construct a family of groups which generalize the Hanoi towers group and study the congruence subgroup problem for the groups in this family. We show that unlike the Hanoi towers group, the groups in this generalization are just infinite…
In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a…
The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was defined, called the \emph{mobile general position problem}, in…
In this work I study a modified Tower of Hanoi puzzle, which I term Magnetic Tower of Hanoi (MToH). The original Tower of Hanoi puzzle, invented by the French mathematician Edouard Lucas in 1883, spans "base 2". That is - the number of…
Finding optimal trajectories for multiple traffic demands in a congested network is a challenging task. Optimal transport theory is a principled approach that has been used successfully to study various transportation problems. Its usage is…
Generalized Tur\'an problems investigate the maximization of the number of certain structures (typically edges) under some constraints in a graph. We study a game version of these problems, the Constructor-Blocker game. We mainly focus on…
We introduce and discuss a simple Hamiltonian dynamical system, interpretable as a 3-body problem in the complex plane and providing the prototype of a mechanism explaining the transition from regular to irregular motions as travel on…
The three-body problem, which describes three masses interacting through Newtonian gravity without any restrictions imposed on the initial positions and velocities of these masses, has attracted the attention of many scientists for more…
This paper presents a new extension of the classical Heron problem, termed the generalized $(k,m)$-Heron problem, which seeks an optimal configuration among $k$ feasible and $m$ target non-empty closed convex sets in $\mathbb{R}^n$. The…
The composite plate problem is an eigenvalue optimization problem related to the fourth order operator $(-\Delta)^2$. In this paper we continue the study started in [10], focusing on symmetry and rigidity issues in the case of the hinged…
CSPTRQ is an interesting problem and its has attracted much attention. The CSPTRQ is a variant of the traditional PTRQ. As objects moving in a constrained-space are common, clearly, it can also find many applications. At the first sight,…
Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…
We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each…
Building upon the minimal time function, we propose and study a novel notion of Tykhonov well-posedness with respect to a set of directions for optimization problems. This concept generalizes the classical Tykhonov well-posedness by…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
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…
This paper provides a theoretical and numerical investigation of a penalty decomposition scheme for the solution of optimization problems with geometric constraints. In particular, we consider some situations where parts of the constraints…