Related papers: Bicycling geodesics are Kirchhoff rods

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are…

A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…

We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…

In a graph $G$, a geodesic between two vertices $x$ and $y$ is a shortest path connecting $x$ to $y$. A subset $S$ of the vertices of $G$ is in general position if no vertex of $S$ lies on any geodesic between two other vertices of $S$. The…

As shown by Masur in 80s, for any translation surface there exists a periodic geodesic of bounded length, the directions of periodic geodesics are dense in the unit circle, and the number of cylinders of periodic geodesics of length at most…

Each free homotopy class of directed closed curves on a surface with boundary can be described by a cyclic reduced word in the generators of the fundamental group and their inverses. The word length is the number of letters of the cyclic…

The geodesic between two points $a$ and $b$ in the interior of a simple polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$. It is thus the natural generalization of straight line segments on unconstrained point…

We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…

The paper is devoted to the study of geodesic orbit Riemannian spaces that could be characterize by the property that any geodesic is an orbit of a 1-parameter group of isometries. In particular, we discuss some important totally geodesic…

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 paper is a study of geodesic in two-dimensional pseudo-Riemannian metrics. Firstly, the local properties of geodesics in a neighborhood of generic parabolic points are investigated. The equation of the geodesic flow has singularities at…

The displacement and deviation vectors in spaces (manifolds), the tangent bundle of which is endowed with a transport along paths, are introduced. In case these spaces are equipped with a linear connection, the deviation equations (between…

All finite Jacobson graphs with a Hamiltonian cycle or path, or Eulerian tour or trail are determined, and it is shown that a finite Jacobson graph is Hamiltonian if and only if it is pancyclic. Also, the length of the longest induced…

The equations for the equilibrium of a thin elastic ribbon are derived by adapting the classical theory of thin elastic rods. Previously established ribbon models are extended to handle geodesic curvature, natural out-of-plane curvature,…

We give lowed bounds on the number of periodic trajectories in strictly convex smooth billiards in $\R^{m+1}$ for $m\ge 3$. For plane billiards (when m=1) such bounds were obtained by G. Birkhoff in the 1920's. Our proof is based on…

We give an algorithm for determining the distance between two vertices of the complex of curves. While there already exist such algorithms, for example by Leasure, Shackleton, and Webb, our approach is new, simple, and more effective for…

There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is…

It is proved that a bijection between two compact hyperbolic surfaces with boundary is an isometry if it and its inverse map each geodesic onto some geodesic.

We introduce the concept of a heterodimensional cycle of hyperbolic ergodic measures and a special type of them that we call rich. Within a partially hyperbolic context, we prove that if two measures are related by a rich heterodimensional…

A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We show that the number of consistent path systems on $n$…