相关论文: The structure of continuous rigid functions of two…

A function $f:\RR \to \RR$ is called \emph{vertically rigid} if $graph(cf)$ is isometric to $graph (f)$ for all $c \neq 0$. We prove Jankovi\'c's conjecture by showing that a continuous function is vertically rigid if and only if it is of…

Cain, Clark and Rose defined a function $f\colon \RR^n \to \RR$ to be \emph{vertically rigid} if $\graph(cf)$ is isometric to $\graph (f)$ for every $c \neq 0$. It is \emph{horizontally rigid} if $\graph(f(c \vec{x}))$ is isometric to…

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…

We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is…

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…

Let $D$ be a convex subset of a real vector space. It is shown that a radially lower semicontinuous function $f: D\to \mathbf{R}\cup \{+\infty\}$ is convex if and only if for all $x,y \in D$ there exists $\alpha=\alpha(x,y) \in (0,1)$ such…

Let $(X,T)$ be a topological dynamical system and $\mu$ be a invariant measure, we show that $(X,\mathcal{B},\mu,T)$ is rigid if and only if there exists some subsequence $A$ of $\mathbb N$ such that $(X,T)$ is $\mu$-$A$-equicontinuous if…

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…

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…

We define periodic frameworks as graphs on the torus, using the language of gain graphs. We present some fundamental definitions and results about the infinitesimal rigidity of graphs on a torus of fixed size and shape, and find necessary…

A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

We say that a graph G is $(k,\ell)$-stable if removing $k$ vertices from it reduces its independence number by at most $\ell$. We say that G is tight $(k,\ell)$-stable if it is $(k,\ell)$-stable and its independence number equals…

The graph $G$ is said to be strongly regular with parameters $(n,k,\lambda,\mu)$ if the following conditions hold: (1) each vertex has $k$ neighbours; (2) any two adjacent vertices of $G$ have $\lambda$ common neighbours; (3) any two…

A framework (a straight-line embedding of a graph into a normed space allowing edges to cross) is globally rigid if any other framework with the same edge lengths with respect to the chosen norm is an isometric copy. We investigate global…

We consider a $\varphi$-rigidity property for divergence-free vector fields in the Euclidean $n$-space, where $\varphi(t)$ is a non-negative convex function vanishing only at $t=0$. We show that this property is always satisfied in…