Related papers: Two dynamical systems in the space of triangles

If a graph $G_M$ is embedded into a closed surface $S$ such that $S \backslash G_M$ is a collection of disjoint open discs, then $M=(G_M,S)$ is called a {\em map}. A {\em zigzag} in a map $M$ is a closed path which alternates choosing, at…

We study a three-dimensional dynamical system in two slow variables and one fast variable. We analyze the tangency of the unstable manifold of an equilibrium point with "the" repelling slow manifold, in the presence of a stable periodic…

We give an overview of the 2026 Computational Geometry Challenge targeting the problem of finding a Central Triangulation under Parallel Flip Operations in triangulations of point sets. A flip is the parallel exchange of a set of edges in a…

On the one hand, the dynamical interior of a self-similar set with open set condition is the complement of the dynamical boundary. On the other hand, the dynamical interior is the recurrent set of the magnification flow. For a finite type…

A rational map between certain specific threefolds is given in an explicit manner.

Two triangle meshes are conformally equivalent if for any pair of incident triangles the absolute values of the corresponding cross-ratios of the four vertices agree. Such a pair can be considered as preimage and image of a discrete…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Let $ G $ be a connected graph. If $\bar{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the proximity, $\pi(G)$, of $G$ is defined as the smallest value of $\bar{\sigma}(v)$ over all…

If two control systems on manifolds of the same dimension are dynamic equivalent, we prove that either they are static equivalent --i.e. equivalent via a classical diffeomorphism-- or they are both ruled; for systems of different…

We introduce a geometric construction which relates to the pentagram map much in the way that a logarithmic spiral relates to a circle. After introducing the construction, we establish some basic geometric facts about it, and speculate on…

The problem of bi-equivariant extension of continuous maps of binary $G$-spaces is considered. The concept of a structural map of distributive binary $G$-spaces is introduced, and a theorem on the bi-equivariant extension of structural maps…

In this paper we look at a sigma model based on the (4, 4) twisted chiral multiplet [3]. It admits two geometric descriptions: The ususal bi-quaternionic geometry on the tangent space and a new geometry involving two Yano F-structures on a…

We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…

We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…

We consider domino tilings of three-dimensional cubiculated manifolds with or without boundary, including subsets of Euclidean space and three-dimensional tori. In particular, we are interested in the connected components of the space of…

Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…

The geometry of rotations in dimensions 3, 4, and 5 is discussed using the matrix exponential map. Explicit closed formulas for the exponential of an antisymmetric matrix, as well as the logarithm of a rotation, are given for these…

We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

A (discrete) dynamical system may have various symmetries and reversing symmetries, which together form its so-called reversing symmetry group. We study the set of 3D trace maps (obtained from two-letter substitution rules) which preserve…