English
Related papers

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

200 papers

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

Combinatorics · Mathematics 2024-01-29 Sean Dewar

We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…

Computational Geometry · Computer Science 2013-08-14 Steven J. Gortler , Craig Gotsman , Ligang Liu , Dylan P. Thurston

A bar-joint framework $(G,p)$ in Euclidean $d$-space is rigid if the only edge-length-preserving continuous motions arise from isometries of $\mathbb{R}^d$. In the generic case, rigidity is determined by the generic $d$-dimensional rigidity…

Combinatorics · Mathematics 2025-06-30 Rebecca Monks , Anthony Nixon

A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…

Combinatorics · Mathematics 2024-04-26 Georg Grasegger , Jan Legerský

We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic…

Metric Geometry · Mathematics 2015-01-16 Ciprian S. Borcea , Ileana Streinu

The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…

Metric Geometry · Mathematics 2017-05-17 Derek Kitson , Stephen Power

We show that universal rigidity of a generic bar and joint framework (G,p) in the line depends on more than the ordering of the vertices. In particular, we construct examples of one-dimensional generic frameworks with the same graph and…

Combinatorics · Mathematics 2021-04-06 Bryan Chen , Robert Connelly , Anthony Nixon , Louis Theran

A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…

Combinatorics · Mathematics 2012-10-05 A. Nixon , J. C. Owen , S. C. Power

A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…

Metric Geometry · Mathematics 2016-05-26 Bill Jackson , J. C. Owen

We consider the problem of characterising the generic rigidity of bar-joint frameworks in $\mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu…

Combinatorics · Mathematics 2022-12-09 James Cruickshank , Hakan Guler , Bill Jackson , Anthony Nixon

For plane frameworks with reflection or rotational symmetries, where the group action is not necessarily free on the vertex set, we introduce a phase-symmetric orbit rigidity matrix for each irreducible representation of the group. We then…

Combinatorics · Mathematics 2024-07-19 Alison La Porta , Bernd Schulze

We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…

Geometric Topology · Mathematics 2015-03-19 Justin Malestein , Louis Theran

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

Combinatorics · Mathematics 2012-07-09 Bill Jackson , J. C. Owen

We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…

Combinatorics · Mathematics 2014-08-12 Shin-ichi Tanigawa

We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…

Combinatorics · Mathematics 2022-05-25 Matteo Gallet , Georg Grasegger , Jan Legerský , Josef Schicho

This monograph introduces key concepts and problems in the new research area of Periodic Geometry and Topology for materials applications.Periodic structures such as solid crystalline materials or textiles were previously classified in…

Computational Geometry · Computer Science 2021-06-10 Olga Anosova , Vitaliy Kurlin

This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…

Analysis of PDEs · Mathematics 2025-11-04 Sedef Özcan

A number of recent papers have studied when symmetry causes frameworks on a graph to become infinitesimally flexible, or stressed, and when it has no impact. A number of other recent papers have studied special classes of frameworks on…

Metric Geometry · Mathematics 2010-06-07 Bernd Schulze , Walter Whiteley

We study the motion of a charge on a conformally flat Riemannian torus in the presence of magnetic field. We prove that for any non-zero magnetic field there always exist orbits of this motion which have conjugate points. We conjecture that…

Dynamical Systems · Mathematics 2007-05-23 M. L. Bialy

A periodic graph in dimension $d$ is a directed graph with a free action of $\Z^d$ with only finitely many orbits. It can conveniently be represented in terms of an associated finite graph with weights in $\Z^d$, corresponding to a…

Mathematical Physics · Physics 2013-06-18 Tobias Fritz