English
Related papers

Related papers: A Proper Definition of Higher Order Rigidity

200 papers

In this paper, we revisit the notion of higher-order rigidity of a bar-and-joint framework. In particular, we provide a link between the rigidity properties of a framework, and the growth order of an energy function defined on that…

Metric Geometry · Mathematics 2025-06-04 Steven J. Gortler , Miranda Holmes-Cerfon , Louis Theran

The famous example of the double-Watt mechanism given by Connelly and Servatius raises some problems concerning the classical definitions of higher-order flexibility and rigidity, respectively. Recently, the author was able to give a proper…

Algebraic Geometry · Mathematics 2025-02-11 Georg Nawratil

The famous example of the double-Watt mechanism given by Connelly and Servatius raises some problems concerning the classical definitions of higher-order flexibility and rigidity, respectively, as they attest the cusp configuration of the…

Algebraic Geometry · Mathematics 2024-09-25 Georg Nawratil

A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar

We present a systematic approach for constructing bar frameworks that are rigid but not first-order rigid, using constrained optimization. We show that prestress stable (but not first-order rigid) frameworks arise as the solution to a…

Metric Geometry · Mathematics 2025-10-31 Xuenan Li , Christian D. Santangelo , Miranda Holmes-Cerfon

We present a new semidefinite Farkas lemma involving a side constraint on the rank. This lemma is then used to present a new proof of a recent characterization, by Connelly and Gortler, of dimensional rigidity of bar frameworks.

Metric Geometry · Mathematics 2014-05-12 A. Y. Alfakih

The notion of $n$th order convexity in the sense of Hopf and Popoviciu is defined via the nonnegativity of the $(n+1)$st order divided differences of a given real-valued function. In view of the well-known recursive formula for divided…

Classical Analysis and ODEs · Mathematics 2018-11-27 Zsolt Páles , Éva Székelyné Radácsi

Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…

Artificial Intelligence · Computer Science 2024-12-04 Xuanxiang Huang , Joao Marques-Silva

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

A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…

Metric Geometry · Mathematics 2017-02-14 Anthony Nixon , Bernd Schulze , Shin-ichi Tanigawa , Walter Whiteley

A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…

Combinatorics · Mathematics 2026-05-19 Zakir Deniz , Hakan Guler , Anthony Nixon

We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…

Systems and Control · Computer Science 2014-06-05 Sicun Gao , Soonho Kong , Edmund Clarke

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.…

Combinatorics · Mathematics 2024-02-23 Sean Dewar , Anthony Nixon , Andrew Sainsbury

A bar-and-joint framework is a finite set of points together with specified distances between selected pairs. In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points…

Combinatorics · Mathematics 2013-08-16 Christopher Clement , Audrey Lee-St. John , Jessica Sidman

We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Ekkehard Koehler , Juergen Teich

The energy-based definition provides a viable resolution to the longstanding confusion on the proper definition of $n$-th order rigidity and flexibility in geometric constraint systems. Applying an energy-based local rigidity analysis to…

Metric Geometry · Mathematics 2025-06-30 Zeyuan He

We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice frameworks we give an $O(n^2)$ algorithm for deciding generic…

Data Structures and Algorithms · Computer Science 2015-03-19 Matthew Berardi , Brent Heeringa , Justin Malestein , Louis Theran

Rigid origami is examined from the perspective of rigidity theory. First and second order rigidity are defined from local differential analysis of the consistency constraint; while the static rigidity and prestress stability are defined…

Metric Geometry · Mathematics 2021-07-22 Zeyuan He , Simon D. Guest

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 2020-07-03 Bill Jackson , Anthony Nixon , Shin-Ichi Tanigawa

This paper is devoted to the construction of order reduced method of fourth order problems. A framework is presented such that a problem on a high-regularity space can be deduced in a constructive way to an equivalent problem on three…

Numerical Analysis · Mathematics 2016-11-02 Shuo Zhang
‹ Prev 1 2 3 10 Next ›