Related papers: Frameworks, Symmetry and Rigidity
Handling symmetries in optimization problems is essential for devising efficient solution methods. In this article, we present a general framework that captures many of the already existing symmetry handling methods. While these methods are…
We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked…
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…
Certain many-particle Hardy inequalities are derived in a simple and systematic way using the so-called ground state representation for the Laplacian on a subdomain of $\mathbb{R}^n$. This includes geometric extensions of the standard Hardy…
Given a functional for a one-dimensional physical system, a classical problem is to minimize it by finding stationary solutions and then checking the positive definiteness of the second variation. Establishing the positive definiteness is,…
We use the symmetry-extended Maxwell rule established by Fowler and Guest to detect states of self-stress in symmetric planar frameworks. The dimension of the space of self-stresses that are detectable in this way may be expressed in terms…
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…
We develop a unified categorical framework for gauging both continuous and finite symmetries in arbitrary spacetime dimensions. Our construction applies to geometric categories i.e. categories internal to stacks. This generalizes the…
Following a review of related results in rigidity theory, we provide a construction to obtain generically universally rigid frameworks with the minimum number of edges, for any given set of n nodes in two or three dimensions. When a set of…
A frame approach to determining the most general solution admitting a desired symmetry group has been examined previously in Riemannian and teleparallel geometries with some success. In teleparallel geometries, one must determine the…
Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…
In this work, we study compact Riemannian manifolds with boundary satisfying V-static-type equations. By combining a generalized Reilly formula with Steklov-type boundary value problems, we derive integral inequalities for geometric…
We introduce a general framework to design and analyze algorithms for the problem of testing homomorphisms between finite groups in the low-soundness regime. In this regime, we give the first constant-query tests for various families of…
A framework is a graph and a map from its vertices to R^d. A framework is called universally rigid if there is no other framework with the same graph and edge lengths in R^d' for any d'. A framework attachment is a framework constructed by…
In this memoir we develop a framework to study rigidity problems for Roe-like C*-algebras of countably generated coarse spaces. The main goal is to give a complete and self-contained solution to the problem of C*-rigidity for proper…
A bar framework determined by a finite graph $G$ and configuration $\bf p$ in $d$ space is universally rigid if it is rigid in any ${\mathbb R}^D \supset {\mathbb R}^d$. We provide a characterization of universally rigidity for any graph…
A one-to-one correspondence between the infinitesimal motions of bar-joint frameworks in $\mathbb{R}^d$ and those in $\mathbb{S}^d$ is a classical observation by Pogorelov, and further connections among different rigidity models in various…
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…
Some remarkable generic properties, related to isostaticity and potential energy minimization, of equilibrium configurations of assemblies of rigid, frictionless grains are studied. Isostaticity -the uniqueness of the forces, once the list…