Related papers: The Four Bars Problem
We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…
This note is a complete library of symbolic parametrized expressions for both real and complexified configuration spaces of a planar 4-bar linkage. Building upon the previous work from Izmestiev (2015), this library expands on the…
We present simulations of bar-unstable stellar discs in which the bars thicken into box/peanut shapes. Detailed analysis of the evolution of each model revealed three different mechanisms for thickening the bars. The first mechanism is the…
High-resolution observations of the inner regions of barred disk galaxies have revealed many asymmetrical, small-scale central features, some of which are best described as secondary bars. Because orbital time-scales in the galaxy center…
We show that non-chaotic multiply-periodic particle orbits can exist in a galaxy-like potential where a small fast-tumbling nuclear bar is nested inside a main bar which has a slower pattern speed. We introduce the concept of a loop: a…
Orbits in galaxy bars are generally complex, but simple closed loop orbits play an important role in our conceptual understanding of bars. Such orbits are found in some well-studied potentials, provide a simple model of the bar in…
Round handles are affiliated with smooth 4-manifolds in two major ways: 5-dimensional round handles appear extensively as the building blocks in cobordisms between 4-manifolds, whereas 4-dimensional round handles are the building blocks of…
We compute analytically and in closed form the four-point correlation function in the plane, and the two-point correlation function in the upper half-plane, of layering vertex operators in the two dimensional conformally invariant system…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
A link in the 3-sphere is called (smoothly) slice if its components bound disjoint smoothly embedded disks in the 4-ball. More generally, given a 4-manifold M with a distinguished circle in its boundary, a link in the 3-sphere is called…
A link in the 3-sphere is homotopically trivial, according to Milnor, if its components bound disjoint maps of disks in the 4-ball. This paper concerns the question of what spaces give rise to the same class of homotopically trivial links…
In this thesis, we study two different graph problems. The first problem revolves around geometric spanners. Here, we have a set of points in the plane and we want to connect them with straight line segments, such that there is a path…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is…
We provide new branched covering representations for bounded and/or non-compact 4-manifolds, which extend the known ones for closed 4-manifolds. Assuming $M$ to be a connected oriented PL 4-manifold, our main results are the following: (1)…
Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the…
Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…
We introduce and study a new four-peg variant of the Tower of Hanoi problem under parity constraints. Two pegs are neutral and allow arbitrary disc placements, while the remaining two pegs are restricted to discs of a prescribed parity: one…
The backbone of double bars is made out of double-frequency orbits, and loops, their maps, indicate the bars' extent, morphology and dynamics.