Related papers: The rigidity of periodic frameworks as graphs on a…

We consider the rigidity and global rigidity of bar-joint frameworks in Euclidean $d$-space under additional dilation constraints in specified coordinate directions. In this setting we obtain a complete characterisation of generic rigidity.…

We construct infinite periodic versions of the stress matrix and establish sufficient conditions for periodic tensegrity frameworks to be globally rigid in $\mathbb{R}^d$ in the cases when the lattice is either fixed, fully flexible, or…

We prove that any ergodic endomorphism on torus admits a sequence of periodic orbits uniformly distributed in the metric sense. As a corollary, an endomorphism on torus is ergodic if and only if the Haar measure can be approximated by…

We prove a topological rigidity theorem for closed hypersurfaces of the Euclidean sphere and of an elliptic space form. It asserts that, under a lower bound hypothesis on the absolute value of the principal curvatures, the hypersurface is…

In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.

We present a survey of results concerning the use of inductive constructions to study the rigidity of frameworks. By inductive constructions we mean simple graph moves which can be shown to preserve the rigidity of the corresponding…

Periodic frameworks with crystallographic symmetry are investigated from the perspective of a general deformation theory of periodic bar-and-joint structures in $R^d$. It is shown that natural parametrizations provide affine section…

In this work we lead with expanding maps of the circle and Anosov diffeomorphisms on $\mathbb{T}^d, d \geq 2.$ We prove that, for these maps, \textit{constant periodic data} imply \textit{same periodic data of these maps and their…

An introduction and survey is given of some recent work on the infinitesimal dynamics of \textit{crystal frameworks}, that is, of translationally periodic discrete bond-node structures in $\mathbb{R}^d$, for $ d=2,3,...$. We discuss the…

The period set of a dynamical system is defined as the subset of all integers $n$ such that the system has a periodic orbit of length $n$. Based on known results on the intersection of period sets of torus maps within a homotopy class, we…

A bar framework in R^r, denoted by G(p), is a simple connected graph G whose vertices are points p^1,...,p^n in R^r that affinely span R^r, and whose edges are line segments between pairs of these points. In this paper, we use stress…

A 2-dimensional direction-length framework is a collection of points in the plane which are linked by pairwise constraints that fix the direction or length of the line segments joining certain pairs of points. We represent it as a pair…

Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…

We show the existence of infinitesimally rigid bipartite unit-bar frameworks in $\mathbb{R}^d$. We also construct unit-bar frameworks with girth up to 12 that are infinitesimally rigid in the plane. This answers problems proposed by…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…

A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…

A result due in its various parts to Hendrickson, Connelly, and Jackson and Jord\'an, provides a purely combinatorial characterisation of global rigidity for generic bar-joint frameworks in $\mathbb{R}^2$. The analogous conditions are known…