Related papers: Characterizing the universal rigidity of generic f…
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 known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
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…
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…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…
A $d$-dimensional body-and-hinge framework is a structure consisting of rigid bodies connected by hinges in $d$-dimensional space. The generic infinitesimal rigidity of a body-and-hinge framework has been characterized in terms of the…
This paper presents an algorithmic framework for the minimization of strictly convex quadratic functions. The framework is flexible and generic. At every iteration the search direction is a linear combination of the negative gradient, as…
Asymptotic equilibrium stresses are defined for countably infinite tensegrities and generalisations of the Roth-Whiteley characterisation of first-order rigidity are obtained. Generalisations of prestress stability and second order rigidity…
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…
Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…
We show that generic automorphisms of stable groups are supertight in a strong sense. In particular, we obtain the existence of supertight automorphisms. We also answer a question concerning the relationship between supertight automorphisms…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
We present a quantitative geometric rigidity estimate in dimensions $d=2,3$ generalizing the celebrated result by Friesecke, James, and M\"uller to the setting of variable domains. Loosely speaking, we show that for each $y \in…
In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
We consider a $\varphi$-rigidity property for divergence-free vector fields in the Euclidean $n$-space, where $\varphi(t)$ is a non-negative convex function vanishing only at $t=0$. We show that this property is always satisfied in…
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…
This paper provides a combinatorial characterisation for generic forced symmetric rigidity of bar-joint frameworks in the Euclidean plane that are symmetric with respect to the orientation-reversing wallpaper group…