Related papers: Rigidity of linearly-constrained frameworks
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…
Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…
A two-dimensional direction-length framework $(G,p)$ consists of a multigraph $G=(V;D,L)$ whose edge set is formed of "direction" edges $D$ and "length" edges $L$, and a realisation $p$ of this graph in the plane. The edges of the framework…
I extend the framework of rigid analytic geometry to the setting of algebraic geometry relative to monoids, and study the associated notions of separated, proper, and overconvergent morphisms. The category of affine manifolds embeds as a…
We consider a periodic lattice structure in $d=2$ or $3$ dimensions with unit cell comprising $Z$ thin elastic members emanating from a similarly situated central node. A general theoretical approach provides an algebraic formula for the…
This work focuses on the bearing rigidity theory, namely the branch of knowledge investigating the structural properties necessary for multi-element systems to preserve the inter-units bearings when exposed to deformations. The original…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices…
In the framework of linearized elasticity, we study thin elastic composite plates with thickness $\delta$. The plates contain small, rigid rectangular plates distributed periodically along $\varepsilon$. Between two neighboring rigid plates…
Recent developments in storage -- especially in the area of resistive random access memory (ReRAM) -- are attempting to scale the storage density by regarding the information data as two-dimensional (2D), instead of one-dimensional (1D).…
We analyse a problem of two-dimensional linearised elasticity for a two-component periodic composite, where one of the components consists of disjoint soft inclusions embedded in a rigid framework. We consider the case when the contrast…
We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and…
We study the linear elasticity system subject to singular forces. We show existence and uniqueness of solutions in two frameworks: weighted Sobolev spaces, where the weight belongs to the Muckenhoupt class $A_2$; and standard Sobolev spaces…
A variational framework is introduced to describe how a surface bends when it is subject to local constraints on its geometry. This framework is applied to describe the patterns of a folded sheet of paper. The unstretchability of paper…
This work considers the problem of estimating the unscaled relative positions of a multi-robot team in a common reference frame from bearing-only measurements. Each robot has access to a relative bearing measurement taken from the local…
A discrete tensegrity framework can be thought of as a graph in Euclidean n-space where each edge is of one of three types: an edge with a fixed length (bar) or an edge with an upper (cable) or lower (strut) bound on its length. Roth and…
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…
We show that if the joints of a bar and joint framework $(G,p)$ are positioned as `generically' as possible subject to given symmetry constraints and $(G,p)$ possesses a `fully-symmetric' infinitesimal flex (i.e., the velocity vectors of…
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…