Related papers: The Four Bars Problem
A bar framework (G,p) in dimension r is a graph G whose vertices are points p^1,...,p^n in R^r and whose edges are line segments between pairs of these points. Two frameworks (G,p) and (G,q) are equivalent if each edge of (G,p) has the same…
In the paper, the family of conformal four-point ladder diagrams in arbitrary space-time dimensions is considered. We use the representation obtained via explicit calculation using the operator approach and conformal quantum mechanics to…
A kinematic chain in three-dimensional Euclidean space consists of $n$ links that are connected by spherical joints. Such a chain is said to be within a closed configuration when its link lengths form a closed polygonal chain in three…
Periodic orbits for the classical $\phi^4$ theory on the one dimensional lattice are systematically constructed by extending the normal modes of the harmonic theory, for periodic, fixed and free boundary conditions. Through the process, we…
This paper studies the problem of using a robot arm to manipulate a uniformly rotating chain with its bottom end fixed. Existing studies have investigated ideal rotational shapes for practical applications, yet they do not discuss how these…
Many strong simulated galactic bars experience buckling instability, which manifests itself as a vertical distortion out of the disk plane, and later dissipates. Using a simulation of an isolated Milky Way-like galaxy, I demonstrate that…
We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non-self-intersecting wire structure (a carpenter's ruler) can…
It is shown that if a link in 3-space bounds a proper oriented surface (without closed component) in the upper half 4-space, then the link bounds a proper oriented ribbon surface in the upper half 4-space which is a renewal embedding of the…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
Origami structures are characterized by a network of folds and vertices joining unbendable plates. For applications to mechanical design and self-folding structures, it is essential to understand the interplay between the set of folds in…
Alternative proof is given for an earlier presented result that if a link in 3-space bounds a compact oriented proper surface (without closed component) in the upper half 4-space, then the link bounds a ribbon surface in the upper half…
We show that the following variant of labeling rotating maps is NP-hard, and present a polynomial approximation scheme for solving it. The input is a set of feature points on a map, to each of which a vertical bar of zero width is assigned.…
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
Denote by $M(P)$ the configuration space of a planar polygonal linkage, that is, the space of all possible planar configurations modulo congruences, including configurations with self-intersections. A particular interest attracts its subset…
Set membership of points in the plane can be visualized by connecting corresponding points via graphical features, like paths, trees, polygons, ellipses. In this paper we study the \emph{bus embeddability problem} (BEP): given a set of…
Using a system of repulsive, soft particles as a model for a jammed solid, we analyze its force network as characterized by the magnitude of the contact force between two particles, the local contact angle subtended between three particles,…
We study the rhomboidal symmetric-mass 4-body problem in both a two-degree-of-freedom and a four-degree-of-freedom setting. Under suitable changes of variables in both settings, isolated binary collisions at the origin are regularizable.…
The pebble-motion on graphs is a subcategory of multi-agent pathfinding problems dealing with moving multiple pebble-like objects from a node to a node in a graph with a constraint that only one pebble can occupy one node at a given time.…
An arrangement of circles in which circles intersect only in angles of $\pi/2$ is called an \emph{arrangement of orthogonal circles}. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is…
Partially ordered patterns (POPs) generalize the notion of classical patterns studied widely in the literature in the context of permutations, words, compositions and partitions. In an occurrence of a POP, the relative order of some of the…