Related papers: The Flexibility and Rigidity of Leaper Frameworks
The mean ($\kappa$) and Gaussian ($\bar{\kappa}$) bending rigidities of liquid-liquid interfaces, of importance for shape fluctuations and topology of interfaces, respectively, are not yet established: even their signs are debated. Using…
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…
Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are `fixed' by various symmetry operations…
It is known that for coprime integers $p>q\geq 1$, the lens space $L(p^2,pq-1)$ bounds a rational ball, $B_{p,q}$, arising as the 2-fold branched cover of a (smooth) slice disk in $B^4$ bounding the associated 2-bridge knot. Lekilli and…
A graph with a trivial automorphism group is said to be rigid. Wright proved that for $\frac{\log n}{n}+\omega(\frac 1n)\leq p\leq \frac 12$ a random graph $G\in G(n,p)$ is rigid whp. It is not hard to see that this lower bound is sharp and…
A bar framework in R^r, denoted by G(p), is a simple connected graph G whose vertices are points p^1,...,p^n in R^r that affinely span R^r, and whose edges are line segments between pairs of these points. In this paper, we use stress…
In this paper, we revisit the notion of higher-order rigidity of a bar-and-joint framework. In particular, we provide a link between the rigidity properties of a framework, and the growth order of an energy function defined on that…
[Connelly and Servatius, 1994] shows the difficulty of properly defining n-th order rigidity and flexiblity of a bar-and-joint framework for higher order (n >= 3) through the introduction of a cusp mechanism. The author proposes a "proper"…
The elastic response is studied of a single flexible chain grafted on a rigid plane and an ensemble of non-interacting tethered chains. It is demonstrated that the entropic theory of rubber elasticity leads to conclusions that disagree with…
We describe surjective linear isometries and linear isometry groups of a large class of Lipschitz-free spaces that includes e.g. Lipschitz-free spaces over any graph. We define the notion of a Lipschitz-free rigid metric space whose…
We study the problem of guaranteeing the connectivity of a given graph by protecting or strengthening edges. Herein, a protected edge is assumed to be robust and will not fail, which features a non-uniform failure model. We introduce the…
A frieze is an array of numbers obeying the unimodular rule. Coxeter showed that a frieze with integer entries corresponds to a triangulation. Recently, Holm and J{\o}rgenson introduced friezes of type $\Lambda_p$ which correspond to…
Polyhedra called Siamese dipyramids are known to be non-flexible, however their physical models behave like physical models of flexible polyhedra. We discuss a simple mathematical method for explaining the model flexibility of the Siamese…
We explore the distinctions between $L^p$ convergence of metric tensors on a fixed Riemannian manifold versus Gromov-Hausdorff, uniform, and intrinsic flat convergence of the corresponding sequence of metric spaces. We provide a number of…
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…
An algebraic framework for noncommutative bundles with (quantum) homogeneous fibres is proposed. The framework relies on the use of principal coalgebra extensions which play the role of principal bundles in noncommutative geometry which…
Rigidity is an emergent property of materials - it is not a feature of individual components that comprise the structure, but instead arises from interactions between many constituent parts. Recently, it has been recognized that…
For any group, there is a natural (pseudo-)norm on the vector space B1 of real (group) 1-boundaries, called the stable commutator length norm. This norm is closely related to, and can be thought of as a relative version of, the Gromov…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
We investigate the general properties of lattice spin models with emerging fermionic excitations. We argue that fermions always come in pairs and their creation operator always has a string-like structure with the newly created particles…