Related papers: Connecting planar linear chains in the spatial $N$…
In this work, we carry out structural and algorithmic studies of a problem of barrier forming: selecting theminimum number of straight line segments (barriers) that separate several sets of mutually disjoint objects in the plane. The…
A minimum cycle basis of a weighted undirected graph $G$ is a basis of the cycle space of $G$ such that the total weight of the cycles in this basis is minimized. If $G$ is a planar graph with non-negative edge weights, such a basis can be…
We study the equal-mass classical three rotor problem, a variant of the three body problem of celestial mechanics. The quantum $N$-rotor problem has been used to model chains of coupled Josephson junctions and also arises via a partial…
This work considers a Motion Planning Problem with Dynamic Obstacles (MPDO) in 2D that requires finding a minimum-arrival-time collision-free trajectory for a point robot between its start and goal locations amid dynamic obstacles moving…
In this note we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of $\mathbb{R}^2$ composed of straight segments joining at triple junctions forming angles…
Planar central configurations can be seen as critical points of the reduced potential or solutions of a system of equations. By the homogeneity and invariance of the potential with respect to SO(2), it is possible to see that the…
A solution of the n-body problem in R^d is a relative equilibrium if all of the mutual distance between the bodies are constant. In other words, the bodies undergo a rigid motion. Here we investigate the possibility of partially rigid…
By using an arithmetic fact, we will firstly prove Saari's conjecture in a particular case, which is called the Elliptical Type N-Body Problem, and then we apply it to prove that the variational minimal solution of the planar Newtonian…
Free time minimizers of the action (called"semi-static" solutions by Ma\~ne) play a central role in the theory of weak KAM solutions to the Hamilton-Jacobi equation (see Fathi). We prove that any solution to Newton's three-body problem…
We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their…
We study the dynamics of the collinear points in the planar, restricted three-body problem, assuming that the primaries move on an elliptic orbit around a common barycenter. The equations of motion can be conveniently written in a rotating…
In the Disjoint Shortest Paths problem one is given a graph $G$ and a set $\mathcal{T}=\{(s_1,t_1),\dots,(s_k,t_k)\}$ of $k$ vertex pairs. The question is whether there exist vertex-disjoint paths $P_1,\dots,P_k$ in $G$ so that each $P_i$…
Central configurations and relative equilibria are an important facet of the study of the $N$-body problem, but become very difficult to rigorously analyze for $N>3$. In this paper we focus on a particular but interesting class of…
Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…
In this work, we study the existence of various classes of standing waves for a nonlinear Schr\"odinger system with quadratic interaction, along with a harmonic or partially harmonic potential. We establish the existence of ground-state…
Logarithmic capacity is shown to be minimal for a planar set having $N$-fold rotational symmetry ($N \geq 3$), among all conductors obtained from the set by area-preserving linear transformations. Newtonian and Riesz capacities obey a…
In this paper, we prove the existence of noncollision singularities in a planar four-body problem in a model different from [J. Xue,Acta Math.V224(2)253-388, 2020.]. In this model, the acceleration can be arbitrarily fast and the masses can…
In a dynamical systems description of spatiotemporally chaotic PDEs including those describing turbulence, chaos is viewed as a trajectory evolving within a network of non-chaotic, dynamically unstable, time-invariant solutions embedded in…
We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set $\mathcal{P}$ of $h$ pairwise-disjoint…
The matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated…