Related papers: Connecting Polygonizations via Stretches and Twang…

We investigate bright matter-wave solitons in the presence of a spatially varying scattering length. It is demonstrated that, even in the absence of any external trapping potential, a soliton can be confined due to the inhomogeneous…

Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…

In this paper, we focus on generating complex robotic trajectories by merging sequential motion primitives. A robotic trajectory is a time series of positions and orientations ending at a desired target. Hence, we first discuss the…

We prove the existence of a finite set of moves sufficient to relate any two representations of the same 3-manifold as a 4-fold simple branched covering of S^3. We also prove a stabilization result: after adding a fifth trivial sheet two…

Particle and string actions on coset spaces typically lack a quadratic kinetic term, making their quantization difficult. We define a notion of twistors on these spaces, which are hypersurfaces in a vector space that transform linearly…

A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or…

We consider the problem of morphing between contact representations of a plane graph. In an $\mathcal F$-contact representation of a plane graph $G$, vertices are realized by internally disjoint elements from a family $\mathcal F$ of…

Let $P$ be a simple polygon of $n$ vertices. We consider two-point $L_1$ shortest path queries in $P$. We build a data structure of $O(n)$ size in $O(n)$ time such that given any two query points $s$ and $t$, the length of an $L_1$ shortest…

We construct a spectral sequence associated to a stratified space, which computes the compactly supported cohomology groups of an open stratum in terms of the compactly supported cohomology groups of closed strata and the reduced cohomology…

A pants decomposition of an orientable surface S is a collection of simple cycles that partition S into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P of n points in the plane, we consider the problem of…

Trapping and un-trapping of spiral tips in a two-dimensional homogeneous excitable medium with local small-world connections is studied by numerical simulation. In a homogeneous medium which can be simulated with a lattice of regular…

Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some…

We propose a novel mechanism that propagates vibration through soft twisted beams, taking advantage of dynamically-coupled anisotropic stiffness to simplify the actuation of walking robots. Using dynamic simulation and experimental…

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all…

The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…

Consider $a$ particles performing simple, symmetric, non-intersecting random walks, starting at points $2(j-1)$, $1\le j\le a$ at time 0 and ending at $2(j-1)+c-b$ at time $b+c$. This can also be interpreted as a random rhombus tiling of an…

We describe and analyse numerically schemes (i) for entangling orthogonal motional modes of one or a few harmonically-trapped atoms or ions, and (ii) for transferring the entanglement from one of these local modes to a distant trapped atom…

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…