Related papers: On Generic Linearly Constrained Frameworks
We consider a generalization of the concept of $d$-flattenability of graphs - introduced for the $l_2$ norm by Belk and Connelly - to general $l_p$ norms, with integer $P$, $1 \le p < \infty$, though many of our results work for $l_\infty$…
It is shown via the principle of path independence that the (time gauge) constraint algebra derived in (Class. Quantum Grav. 5 (1988) pg. 1405) for vielbein General Relativity is a generic feature of any covariant theory formulated in a…
A crystallographic bar-joint framework C is shown to be almost periodically infinitesimally rigid if and only if it is strictly periodically infinitesimally rigid and the rigid unit mode (RUM) spectrum is a singleton. Moreover the almost…
We define a generic rigidity matroid for $k$-volumes of a simplicial complex in $\mathbb{R}^d$, and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic $d$-rigidity matroid on the same vertex set (namely, the…
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…
This paper discusses generalized weak rigidity theory, and aims to apply the theory to formation control problems with a gradient flow law. The generalized weak rigidity theory is utilized in order that desired formations are characterized…
This letter describes a novel derivation of general relativity by considering the (non)self-consistency of theories whose Hamiltonians are constraints. The constraints, from Hamilton's equations, generate the evolution, while the evolution,…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
In generalized linear regression problems with an abundant number of features, lasso-type regularization which imposes an $\ell^1$-constraint on the regression coefficients has become a widely established technique. Deficiencies of the…
A very simple criterion to ascertain if (D-2)-surfaces are trapped in arbitrary D-dimensional Lorentzian manifolds is given. The result is purely geometric, independent of the particular gravitational theory, of any field equations or of…
We prove rigidity results describing contextually-constrained maps defined on Grassmannians and manifolds of ordered independent line tuples in finite-dimensional vector or Hilbert spaces. One statement in the spirit of the Fundamental…
We characterise rigid graphs for cylindrical normed spaces $Z=X\oplus_\infty \mathbb{R}$ where $X$ is a finite dimensional real normed linear space and $Z$ is endowed with the product norm. In particular, we obtain purely combinatorial…
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
A major challenge in structured prediction is to represent the interdependencies within output structures. When outputs are structured as sequences, linear-chain conditional random fields (CRFs) are a widely used model class which can learn…
In this paper we formulate and prove necessary and sufficient geometric conditions for existence of generic tensegrities in the plane for arbitrary graphs. The conditions are written in terms of "meet-join" relations for the configuration…
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…
In this paper we present an algorithm for enumerating without repetitions all the non-crossing generically minimally rigid bar-and-joint frameworks under edge constraints (also called constrained non-crossing Laman frameworks) on a given…
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…
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…
It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give…