Related papers: On the Complexity of Bicycle Unitracks
The paper discusses two models for non-overlapping finite line-segments constructed via the lilypond protocol, operating here on a given array of points in the plane with which are associated directions. At time 0, each line-segment starts…
Numerous studies have reported two types of doubling of invariant closed curves (ICCs) in dynamical systems: (a) the creation of two disjoint ICCs such that iterations flip between them; and (b) the creation of a single ICC of double the…
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian, this baseline result is used as the basis of existence proofs for universal cycles (also known as generalized deBruijn cycles or U-cycles) of…
Trajectory tracking for the kinematic unicycle has been heavily studied for several decades. The unicycle admits a natural $\SE(2)$ symmetry, a key structure exploited in many of the most successful nonlinear controllers in the literature.…
This article analyzes the complex geometry of urban transportation networks as a gateway to understanding their encompassing urban systems. Using a proposed ring-buffer approach and applying it to 50 urban areas in the United States, we…
Counting short cycles in bipartite graphs is a fundamental problem of interest in the analysis and design of low-density parity-check (LDPC) codes. The vast majority of research in this area is focused on algorithmic techniques. Most…
This paper proposes a simple technique of curve and surface construction with B-splines. Given a control polygon or a control mesh together with node ordinates corresponding to all control points, a rational curve or surface is obtained by…
A curve is rectifying if it lies on a moving hyperplane orthogonal to its curvature vector. In this work, we extend the main result of [Chen 2017, Tamkang J. Math. 48, 209] to any space dimension: we prove that rectifying curves are…
We have found an oscillating instability of fast-running cracks in thin rubber sheets. A well-defined transition from straight to oscillating cracks occurs as the amount of biaxial strain increases. Measurements of the amplitude and…
In this work, we study the classical distributed optimization problem over digraphs, where the objective function is a sum of smooth local functions. Inspired by the implicit tracking mechanism proposed in our earlier work, we develop a…
Thin elastic sheets bend easily, leading to mechanical instabilities such as wrinkling. Here, we investigate wrinkles at edges of bi-strips, which consist of two thin sheets, one that swells and one that does not, joined side-by-side. It is…
A sandpile is a cellular automaton on a graph that evolves by the following toppling rule: if the number of grains at a vertex is at least its valency, then this vertex sends one grain to each of its neighbors. In the study of pattern…
One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this form, it was first written down by Thomassen in 1978,…
In this note, we completely describe the shape of the bisector of two given points in a two-dimensional normed vector space. More precisely, we show that, depending on the position of two given points with respect to the shape of the unit…
Planar piecewise linear systems with two linearity zones separated by a straight line and with a periodic orbit at infinity are considered. By using some changes of variables and parameters, a reduced canonical form with five parameters is…
In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…
Pedal and contrapedal curves are important study objects of plane curves. As for a mixed-type Minkowski plane curve, since the definitions of the pedal and contrapedal curves at lightlike points can not always be given, the investigation of…
We study large uniform random maps with one face whose genus grows linearly with the number of edges, which are a model of discrete hyperbolic geometry. In previous works, several hyperbolic geometric features have been investigated. In the…
Let $D$ be a digraph. A subset $S$ of $V(D)$ is a stable set if every pair of vertices in $S$ is non-adjacent in $D$. A collection of disjoint paths $\mathcal{P}$ of $D$ is a path partition of $V(D)$, if every vertex in $V(D)$ is exactly on…
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…