101,233 research outputs found
Using Elimination Theory to construct Rigid Matrices
The rigidity of a matrix A for target rank r is the minimum number of entries
of A that must be changed to ensure that the rank of the altered matrix is at
most r. Since its introduction by Valiant (1977), rigidity and similar
rank-robustness functions of matrices have found numerous applications in
circuit complexity, communication complexity, and learning complexity. Almost
all nxn matrices over an infinite field have a rigidity of (n-r)^2. It is a
long-standing open question to construct infinite families of explicit matrices
even with superlinear rigidity when r = Omega(n).
In this paper, we construct an infinite family of complex matrices with the
largest possible, i.e., (n-r)^2, rigidity. The entries of an n x n matrix in
this family are distinct primitive roots of unity of orders roughly exp(n^2 log
n). To the best of our knowledge, this is the first family of concrete (but not
entirely explicit) matrices having maximal rigidity and a succinct algebraic
description.
Our construction is based on elimination theory of polynomial ideals. In
particular, we use results on the existence of polynomials in elimination
ideals with effective degree upper bounds (effective Nullstellensatz). Using
elementary algebraic geometry, we prove that the dimension of the affine
variety of matrices of rigidity at most k is exactly n^2-(n-r)^2+k. Finally, we
use elimination theory to examine whether the rigidity function is
semi-continuous.Comment: 25 Pages, minor typos correcte
The orbit rigidity matrix of a symmetric framework
A number of recent papers have studied when symmetry causes frameworks on a
graph to become infinitesimally flexible, or stressed, and when it has no
impact. A number of other recent papers have studied special classes of
frameworks on generically rigid graphs which are finite mechanisms. Here we
introduce a new tool, the orbit matrix, which connects these two areas and
provides a matrix representation for fully symmetric infinitesimal flexes, and
fully symmetric stresses of symmetric frameworks. The orbit matrix is a true
analog of the standard rigidity matrix for general frameworks, and its analysis
gives important insights into questions about the flexibility and rigidity of
classes of symmetric frameworks, in all dimensions.
With this narrower focus on fully symmetric infinitesimal motions, comes the
power to predict symmetry-preserving finite mechanisms - giving a simplified
analysis which covers a wide range of the known mechanisms, and generalizes the
classes of known mechanisms. This initial exploration of the properties of the
orbit matrix also opens up a number of new questions and possible extensions of
the previous results, including transfer of symmetry based results from
Euclidean space to spherical, hyperbolic, and some other metrics with shared
symmetry groups and underlying projective geometry.Comment: 41 pages, 12 figure
Crystal frameworks, symmetry and affinely periodic flexes
Symmetry equations are obtained for the rigidity matrices associated with
various forms of infinitesimal flexibility for an idealised bond-node crystal
framework \C in \bR^d. These equations are used to derive symmetry-adapted
Maxwell-Calladine counting formulae for periodic self-stresses and affinely
periodic infinitesimal mechanisms. The symmetry equations also lead to general
Fowler-Guest formulae connecting the character lists of subrepresentations of
the crystallographic space and point groups which are associated with bonds,
nodes, stresses, flexes and rigid motions. A new derivation is also given for
the Borcea-Streinu rigidity matrix and the correspondence between its nullspace
and the space of affinely periodic infinitesimal flexes.Comment: This preprint has some new diagrams and clarifications. A final
version will appear in the New York Journal of Mathematic
A Unified Dissertation on Bearing Rigidity Theory
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 contributions are twofold. The first one consists in the definition of
a general framework for the statement of the principal definitions and results
that are then particularized by evaluating the most studied metric spaces,
providing a complete overview of the existing literature about the bearing
rigidity theory. The second one rests on the determination of a necessary and
sufficient condition guaranteeing the rigidity properties of a given
multi-element system, independently of its metric space
Frameworks, Symmetry and Rigidity
Symmetry equations are obtained for the rigidity matrix of a bar-joint
framework in R^d. These form the basis for a short proof of the Fowler-Guest
symmetry group generalisation of the Calladine-Maxwell counting rules. Similar
symmetry equations are obtained for the Jacobian of diverse framework systems,
including constrained point-line systems that appear in CAD, body-pin
frameworks, hybrid systems of distance constrained objects and infinite
bar-joint frameworks. This leads to generalised forms of the Fowler-Guest
character formula together with counting rules in terms of counts of
symmetry-fixed elements. Necessary conditions for isostaticity are obtained for
asymmetric frameworks, both when symmetries are present in subframeworks and
when symmetries occur in partition-derived frameworks.Comment: 5 Figures. Replaces Dec. 2008 version. To appear in IJCG
- âŠ