Related papers: Dynamic Schnyder Woods
We consider the space of all representations of the commutator subgroup of a knot group into a finite abelian group {\Sigma}, together with a shift map {\sigma}_x. This is a finite dynamical system, introduced by D.Silver and S. Williams.…
One of the questions in Rigidity Theory is whether a realization of the vertices of a graph in the plane is flexible, namely, if it allows a continuous deformation preserving the edge lengths. A flexible realization of a connected graph in…
In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move along straight-line trajectories at constant speed. We show…
We develop combinatorial methods for computing the rotation distance between binary trees, i.e., equivalently, the flip distance between triangulations of a polygon. As an application, we prove that, for each n, there exist size n trees at…
Heterodimensional cycles are heteroclinic cycles that connect periodic orbits whose unstable manifolds have different dimensions. This is a source of nonhyperbolic dynamics and unstable dimension variability. For smooth invertible maps…
The Glauber model on a one-dimensional lattice with boundaries (for the ferromagnetic- and anti-ferromagnetic case) is considered. The large-time behaviour of the one-point function is studied. It is shown that, for any positive…
Cop-width and flip-width are new families of graph parameters introduced by Toru\'nczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and twin-width. In this paper, we bound the cop-width and…
A plane partition, whose 3D Young diagram is made of unit cubes, can be approximated by a ``coarser" plane partition, made of cubes of side length 2. Indeed, there are two such approximations obtained by ``rounding up" or ``rounding down"…
We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…
For a set $P$ of $n$ points in general position in the plane, the flip graph $F(P)$ has a vertex for each non-crossing spanning tree on $P$ and an edge between any two spanning trees that can be transformed into each other by one edge flip.…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
For piecewise-smooth differential systems, in this paper we focus on crossing limit cycles and sliding loops bifurcating from a grazing loop connecting one high multiplicity tangent point. For the low multiplicity cases considered in…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
A family of periodic perturbations of an attracting robust heteroclinic cycle defined on the two-sphere is studied by reducing the analysis to that of a one-parameter family of maps on a circle. The set of zeros of the family forms a…
We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of…
Mahlmann and Schindelhauer (2005) defined a Markov chain which they called $k$-Flipper, and showed that it is irreducible on the set of all connected regular graphs of a given degree (at least 3). We study the 1-Flipper chain, which we call…
We study the problem of drawing a dynamic graph, where each vertex appears in the graph at a certain time and remains in the graph for a fixed amount of time, called the window size. This defines a graph story, i.e., a sequence of…
New sufficient conditions and necessary conditions are developed for two skew diagrams to give rise to the same skew Schur function. The sufficient conditions come from a variety of new operations related to ribbons (also known as border…
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with…
We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as…