Related papers: The orbit rigidity matrix of a symmetric framework
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 show that universal rigidity of a generic bar and joint framework (G,p) in the line depends on more than the ordering of the vertices. In particular, we construct examples of one-dimensional generic frameworks with the same graph and…
If we take a (bar-joint) framework, prepare an identical copy of this framework, translate it by some vector $\tau$, and finally join corresponding points of the two copies, then we obtain a framework with `extrusion' symmetry in the…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
Variables adapted to the quantum dynamics of spherically symmetric models are introduced, which further simplify the spherically symmetric volume operator and allow an explicit computation of all matrix elements of the Euclidean and…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
Representing various networked data as multiplex networks, networks of networks and other multilayer networks can reveal completely new types of structures in these system. We introduce a general and principled graphlet framework for…
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…
An introduction and survey is given of some recent work on the infinitesimal dynamics of \textit{crystal frameworks}, that is, of translationally periodic discrete bond-node structures in $\mathbb{R}^d$, for $ d=2,3,...$. We discuss the…
In this paper, we establish a general setup for studying incidence-preserving motions of projective geometric configurations of points and lines via a "projective rigidity matrix". The spaces of infinitesimal motions of a point-line…
Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…
In this work, we relate the geometry of chaotic attractors of typical analytic unimodal maps to the behavior of the critical orbit. Our main result is an explicit formula relating the combinatorics of the critical orbit with the exponents…
In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
This thesis is dedicated to the study of symmetries in reduced models of gravity, with some frozen degrees of freedom. We focus on the minisuperspace reduction whith a finite number of degrees of freedom. Minisuperspaces are treated as…
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…
The influence of the orbital symmetry on the ellipticity of the high-order harmonics is investigated. It is found that the ellipticity maps have distinct shapes for the molecular orbital with different symmetry. Our analysis shows that the…
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…