Related papers: The Four Bars Problem
In this paper, we consider the linear stability of the elliptic relative equilibria of the restricted 4-body problems where the three primaries form a Lagrangian triangle. By reduction, the linearized Poincar\'e map is decomposed to the…
We present explicit algorithms for simplifying the topology of indefinite fibrations on 4-manifolds, which include broken Lefschetz fibrations and indefinite Morse 2-functions. The algorithms consist of sequences of moves, which modify…
Given a point set $\mathcal{P}$ and a plane perfect matching $\mathcal{M}$ on $\mathcal{P}$, a flip is an operation that replaces two edges of $\mathcal{M}$ such that another plane perfect matching on $\mathcal{P}$ is obtained. Given two…
An algorithm to compute the six distances between particles of a planar Four-Body central configuration is presented according to the following schema. An orthocentric tetrahedron is computed as a function of given masses. Each mass is…
We study two-dimensional, two-piece, piecewise-linear maps having two saddle fixed points. Such maps reduce to a four-parameter family and are well known to have a chaotic attractor throughout open regions of parameter space. The purpose of…
How does one determine if a collection of bars joined by freely rotating hinges cannot be deformed without changing the length of any of the bars? In other words, how does one determine if a bar-joint graph is rigid? This question has been…
We consider the linearized elasticity system in a multidomain of the three dimensional space. This multidomain is the union of a horizontal plate, with fixed cross section and small thickness "h", and of a vertical beam with fixed height…
Criteria for piecewise linear circle homeomorphisms to be conjugate to a rigid rotation, $x\to x+\omega~({\rm mod}~1)$, with rational rotation number $\omega$ are given. The consequences of the existence of such maps in families of maps is…
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged…
A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The first author recently showed that the…
Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…
The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…
We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…
Let $\mathcal{P}$ be a set of $n=2m+1$ points in the plane in general position. We define the graph $GM_\mathcal{P}$ whose vertex set is the set of all plane matchings on $\mathcal{P}$ with exactly $m$ edges. Two vertices in…
Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.
Constraint Satisfaction Problem (CSP) is a framework for modeling and solving a variety of real-world problems. Once the problem is expressed as a finite set of constraints, the goal is to find the variables' values satisfying them. Even…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…
We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…