Related papers: Polygonal Bicycle Paths and the Darboux Transforma…

An $H$-decomposition of $G$ is a partition of the edge-set of $G$ into subsets, where each subset induces a copy of the graph $H$. A $k$-orthogonal $H$-decomposition of a graph $G$ is a set of $k$ $H$-decompositions of $G$, such that any…

The vertex set of the kth cartesian power of a directed cycle of length m can be naturally identified with the set of k-tuples of integers modulo m. For any two vertices v and w of this graph, it is easy to see that if there is a…

A popular classroom demonstration is to draw a cycloid on a blackboard with a piece of chalk inserted through a hole at a point P with radius r = R from the center of a wood disk of radius R that is rolling without slipping along the chalk…

In this work we define Magic Polygons P (n, k) and Degenerated Magic Polygons D(n, k) and we obtain their main properties, such as the magic sum and the value corresponding to the root vertex. The existence of magic polygons P (n, k) and…

In this paper, we report the bifurcations of mode-locked periodic orbits occurring in maps of three or higher dimensions. The `torus' is represented by a closed loop in discrete time, which contains stable and unstable cycles of the same…

For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are…

Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…

Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Bloch theorem for a periodic operator is being revisited here, and we notice extra orthogonality relationships. It is shown that solutions are bi-periodic, in the sense that eigenfunctions are periodic with respect to one argument, and…

Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any…

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations…

In this paper, we introduce discrete conics, polygonal analogues of conics. We show that discrete conics satisfy a number of nice properties analogous to those of conics, and arise naturally from several constructions, including the…

For a fixed $p \in \mathbb{N}$, sequences of polynomials $\{P_n\}$, $n \in \mathbb{N}$, defined by a $(p+2)$-term recurrence relation are related to several topics in Approximation Theory. A $(p+2)$-banded matrix $J$ determines the…

In this paper we define novel topological invariants of doubly periodic tangles (DP tangles). DP tangles are embeddings of curves in the thickened plane with translational symmetries in two independent directions. We first organize the…

We study a natural construction of a general class of inhomogeneous quantum walks (namely walks whose transition probabilities depend on position). Within the class we analyze walks that are periodic in position and show that, depending on…

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and…

Sets of three types of convex pentagons that are aperiodic with no matching conditions on the edges are created from a chiral aperiodic monotile Tile(1, 1). This method divides the interior of Tile(1,1) into five convex polygons with five…

The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…