Related papers: Polygonal Bicycle Paths and the Darboux Transforma…

A bicycle path is a pair of trajectories in ${\mathbb R}^n$, the `front' and `back' tracks, traced out by the endpoints of a moving line segment of fixed length (the `bicycle frame') and tangent to the back track. Bicycle geodesics are…

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle structure is amenable to complete analysis. In particular, each…

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote,…

A cyclic $n$-gonal surface is a compact Riemann surface $X$ of genus $g\geq 2$ admitting a cyclic group of conformal automorphisms $C$ of order $n$ such that the quotient space $X/C$ has genus 0. In this paper, we provide an overview of…

The study of polygonal billiards, particularly those in the regular pentagon, has been the subject of two recent papers. One of these papers approaches the problem of discovering the periodic trajectories on the pentagon by identifying…

We study closed smooth convex plane curves $\Gamma$ enjoying the following property: a pair of points $x,y$ can traverse $\Gamma$ so that the distances between $x$ and $y$ along the curve and in the ambient plane do not change; such curves…

Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…

An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…

Formulas about the side lengths, diagonal lengths or radius of the circumcircle of a cyclic polygon in Euclidean geometry, hyperbolic geometry or spherical geometry can be unified.

We analyze the relationship between Bott periodicity in topological $K$-theory and the natural periodicity of cyclic homology. This is a basis for understanding the multiplicativity, in odd dimensions, of a bivariant Chern-Connes character…

Generalized Dyck paths (or discrete excursions) are one-dimensional paths that take their steps in a given finite set S, start and end at height 0, and remain at a non-negative height. Bousquet-M\'elou showed that the generating function…

The Newton--Okounkov body of a big divisor D on a smooth surface is a numerical invariant in the form of a convex polygon. We study the geometric significance of the shape of Newton--Okounkov polygons of ample divisors, showing that they…

We prove that if a polygon admits a periodic billiard orbit satisfying a certain combinatorial criterion, then there are paths of polygons in parameter space for which every polygon in the path admits a periodic billiard orbit of the same…

We construct a polygonal spiral by arranging a sequence of regular $n$-gons such that each $n$-gon shares a specified side and vertex with the $(n+1)$-gon in the construction. By offering flexibility for determining the size of each $n$-gon…

The varietal hypercube $VQ_n$ is a variant of the hypercube $Q_n$ and has better properties than $Q_n$ with the same number of edges and vertices. This paper shows that every edge of $VQ_n$ is contained in cycles of every length from 4 to…

It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

We express Darboux transformations of discrete polarised curves as parallel sections of discrete connections in the quaternionic formalism. This immediately leads to the linearisation of the monodromy of the transformation. We also consider…

A \textit{Reinhardt polygon} is a convex $n$-gon that, for $n$ not a power of $2$, is optimal in three different geometric optimization problems, for example, it has maximal perimeter relative to its diameter. Some such polygons exhibit a…