Related papers: Generic symmetry-forced infinitesimal rigidity: tr…
The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…
This paper looks at how changes of coordinates on a pseudo-Riemannian manifold induce homogeneous linear transformations on its tangent spaces. We see that a pseudo-orthonormal frame in a given tangent space is the basis for a set of…
We propose a generalization of the isometry transformations to the geometric context of the field theories with spin where the local frames are explicitly involved. We define the external symmetry transformations as isometries combined with…
We classify all closed, aspherical Riemannian manifolds M whose universal cover has indiscrete isometry group. One sample application is the theorem that any such M with word-hyperbolic fundamental group must be isometric to a negatively…
Combinatorial characterisations are obtained of symmetric and anti-symmetric infinitesimal rigidity for two-dimensional frameworks with reflectional symmetry in the case of norms where the unit ball is a quadrilateral and where the…
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…
A general model for geometric structures on differentiable manifolds is obtained by deforming infinitesimal symmetries. Specifically, this model consists of a Lie algebroid, equipped with an affine connection compatible with the Lie…
Teleparallel gravity theories employ a tetrad and a Lorentz spin connection as independent variables in their covariant formulation. In order to solve their field equations, it is helpful to search for solutions which exhibit certain…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $\mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
We describe symmetry structure of a general singular theory (theory with constraints in the Hamiltonian formulation), and, in particular, we relate the structure of gauge transformations with the constraint structure. We show that any…
A well-known combinatorial algorithm can decide generic rigidity in the plane by determining if the graph is of Pollaczek-Geiringer-Laman type. Methods from matroid theory have been used to prove other interesting results, again under the…
We study the infinitesimal rigidity of equivariant minimal maps from the universal cover of a smooth oriented surface (possibly non-compact) into a Riemannian symmetric space, focusing on representations arising from cyclic harmonic…
We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
We develop a rigidity theory for bar-joint frameworks in Euclidean $d$-space in which specified classes of edges are allowed to change length in a coordinated fashion that requires differences of lengths to be preserved within each class.…
We show that a generic framework $(G,p)$ on the cylinder is globally rigid if and only if $G$ is a complete graph on at most four vertices or $G$ is both redundantly rigid and $2$-connected. To prove the theorem we also derive a new…