Related papers: On the Complexity of Bicycle Unitracks
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
The pedal of a curve in the Euclidean plane is a classical subject which has a singular point at the inflection point of the original curve or the pedal point. The primitive of a curve is a curve given by the inverse construction for making…
Let $S$ be a complete flat surface, such as the Euclidean plane. We obtain direct characterizations of the connected components of the space of all curves on $S$ which start and end at given points in given directions, and whose curvatures…
In this article, we address the control problem of unicycle path following, using a rigidly attached target point. The initial path following problem has been transformed into a reference trajectory following problem, using saturated…
We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to…
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…
Generalized cycles can be thought of as the extension of form-cycle duality between holomorphic forms and cycles, to meromorphic forms and generalized cycles. They appeared as an ubiquitous tool in the study of spectral curves and…
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid…
Motion planning is a fundamental problem of robotics with applications in many areas of computer science and beyond. Its restriction to graphs has been investigated in the literature for it allows to concentrate on the combinatorial problem…
Generic relative immersions of compact one-manifolds in the closed unit disk, i.e. divides, provide a powerful combinatorial framework, and allow a topological construction of fibered classical links, for which the monodromy diffeomorphism…
A curve has the increasing chord property if for any points $a,b,c,d$ in this order on the curve, the distance of $a,d$ is not smaller than that of $b,c$. Answering a conjecture of Larman and McMullen, Rote proved in 1994 that the arclength…
Curves in ${\mathbb R}^n$ for which the ratios between two consecutive curvatures are constant are characterized by the fact that their tangent indicatrix is a geodesic in a flat torus. For $n= 3,4$, spherical curves of this kind are also…
Based on an extension of the fiber bundle model we investigate numerically the motion of the crack front through a weak plane separating a soft and an infinitely stiff block. We find that there are two regimes. At large scales the motion is…
A novel approach to velodrome design for UCI-regulated tracks is presented. The mathematical model uses differential geometry to form a three-dimensional ruled surface. The surface accounts for the safety zone, blue band, and track region,…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
We consider a unit speed curve $\alpha$ in Euclidean $n$-dimensional space $E^n$ and denote the Frenet frame by $\{v_1,...,v_n\}$. We say that $\alpha$ is a cylindrical helix if its tangent vector $v_1$ makes a constant angle with a fixed…
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and non-recurrent parts. We define the spectral complexity metric in terms of the…
The (parallel) linear transports along paths in vector bundles are axiomatically described. Their general form and certain properties are found. It is shown that these transports are locally (i.e. along every fixed path) always Euclidean…
By Dirichlet's Unit Theorem, under the log embedding the units in the ring of integers of a number field form a lattice, called the log-unit lattice. We investigate the geometry of these lattices when the number field is a biquadratic or…