Related papers: Epsilon local rigidity and numerical algebraic geo…
The celebrated result of Gortler-Healy-Thurston (independently, Jackson-Jord\'an for $d=2$) shows that the global rigidity of graphs realised in the $d$-dimensional Euclidean space is a generic property. Extending this result to the global…
We consider an abstract second order linear equation with a strong dissipation, namely a friction term which depends on a power of the "elastic" operator. In the homogeneous case, we investigate the phase spaces in which the initial value…
We study the discrete dynamical system obtained by repeatedly applying the Pearson correlation operator to a real matrix. Each step centers every row, normalizes each centered row to unit Euclidean norm, and forms the Gram matrix of the…
We give a new proof for the local existence of a smooth isometric embedding of a smooth $3$-dimensional Riemannian manifold with nonzero Riemannian curvature tensor into $6$-dimensional Euclidean space. Our proof avoids the sophisticated…
The local volatility model is a widely used for pricing and hedging financial derivatives. While its main appeal is its capability of reproducing any given surface of observed option prices---it provides a perfect fit---the essential…
In 2005, Bob Connelly showed that a generic framework in $\bR^d$ is globally rigid if it has a stress matrix of maximum possible rank, and that this sufficient condition for generic global rigidity is preserved by the 1-extension operation.…
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 aperiodic order, non-periodic but "ordered" objects such as tilings, Delone sets, functions and measures are investigated. In this article we depict the common structure of these objects by using the general framework of abstract pattern…
Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
A configuration p in r-dimensional Euclidean space is a finite collection of labeled points p^1,p^2,...,p^n in R^r that affinely span R^r. Each configuration p defines a Euclidean distance matrix D_p = (d_ij) = (||p^i-p^j||^2), where ||.||…
We make a detailed investigation of the generic properties that polynomial mappings possess. An important starting point is the work by Farnik, Jelonek and Ruas in 2019, where they prove some of those properties in the context of…
We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization…
Let $J$ be a semisimple Lie group with all simple factors of real rank at least two. Let $\Gamma<J$ be a lattice. We prove a very general local rigidity result about actions of $J$ or $\Gamma$. This shows that almost all so-called "standard…
A systematic procedure is proposed for deriving all the gauge symmetries of the general, not necessarily variational, equations of motion. For the variational equations, this procedure reduces to the Dirac-Bergmann algorithm for the…
This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…
A central question in dynamics is whether the topology of a system determines its geometry. This is known as rigidity. Under mild topological conditions rigidity holds for many classical cases, including: Kleinian groups, circle…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
While structural width parameters (of the input) belong to the standard toolbox of graph algorithms, it is not the usual case in computational geometry. As a case study we propose a natural extension of the structural graph parameter of…
A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…