Related papers: Generalizations of the Hanoi Towers Problem
This paper proposes a methodology to stabilize relative equilibria in a model of identical, steered particles moving in three-dimensional Euclidean space. Exploiting the Lie group structure of the resulting dynamical system, the…
{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…
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…
Classical turnpikes correspond to optimal steady states which are attractors of optimal control problems. In this paper, motivated by mechanical systems with symmetries, we generalize this concept to manifold turnpikes. Specifically, the…
The goal of this note is to explore, from a geometric and probabilistic point of view, the dynamics of cone structures adapted to open book decompositions. This is inspired by the picture which arises in the study of the circular restricted…
We consider a variation of the classical Erd\H{o}s-Szekeres problems on the existence and number of convex $k$-gons and $k$-holes (empty $k$-gons) in a set of $n$ points in the plane. Allowing the $k$-gons to be non-convex, we show bounds…
In this paper, we investigate the global well-posedness and optimal time-decay of classical solutions for the 3-D full compressible Navier-Stokes system, which is given by the motion of the compressible viscous and heat-conductive gases.…
The edge geodesic cover problem of a graph $G$ is to find a smallest number of geodesics that cover the edge set of $G$. The edge $k$-general position problem is introduced as the problem to find a largest set $S$ of edges of $G$ such that…
We study the $k$-center problem in a kinetic setting: given a set of continuously moving points $P$ in the plane, determine a set of $k$ (moving) disks that cover $P$ at every time step, such that the disks are as small as possible at any…
Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known…
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…
The primary quantum mechanical equation of motion entails that measurements typically do not have determinate outcomes, but result in superpositions of all possible outcomes. Dynamical collapse theories (e.g. GRW) supplement this equation…
Certain topics on polygons are extended from Euclidean to hyperbolic geometry. This first part deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The non-Euclidean versions are more difficult due to the…
The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…
We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line…
After summarizing the status of the Standard Model, we focus on the Hierarchy Problem and why we believe this strongly suggests the need for new physics at the TeV scale. We then concentrate on theories with extra dimensions and their…
In this paper we are concerned with three lattice problems: the lattice packing problem, the lattice covering problem and the lattice packing-covering problem. One way to find optimal lattices for these problems is to enumerate all finitely…
The subject is brake orbits for the 3-body problem: orbits where all velocities are zero at some instant. We extract a paradox and a mystery out of a recent database of 30 non-collision periodic brake orbits for the equal mass 3-body…
An algebraic telic problem is a decision problem in $\textsf{NP}_\mathbb{R}$ formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the existence of "natural" mapping reductions between algebraic…