Related papers: Epsilon local rigidity and numerical algebraic geo…
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…
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…
We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance. We apply…
We find computable criteria for stability of symplectic leaves of Poisson manifolds. Using Poisson geometry as an inspiration, we also give a general criterion for stability of leaves of Lie algebroids, including singular ones. This not…
We prove a rigidity theorem in Poisson geometry around compact Poisson submanifolds, using the Nash-Moser fast convergence method. In the case of one-point submanifolds (fixed points), this immediately implies a stronger version of Conn's…
Local flatness is a property shared by all the spin foam models. It ensures that the theory's fundamental building blocks are flat by requiring locally trivial parallel transport. In the context of simplicial Lorentzian spin foam theory, we…
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…
In this paper we will algorithmically prove the local and global epsilon constant conjectures for all fields of absolute degree lower or equal to 15. To this end we will present an efficient algorithm for the computation of local…
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 establish that for q>=1, the class of convex combinations of q translates of a smooth probability density has local doubling dimension proportional to q. The key difficulty in the proof is to control the local geometric structure of…
We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial characterizations of minimally rigid periodic frameworks with…
All global solutions of arbitrary topology of the most general 1+1 dimensional dilaton gravity models are obtained. We show that for a generic model there are globally smooth solutions on any non-compact 2-surface. The solution space is…
We consider a strongly heterogeneous medium saturated by an incompressible viscous fluid as it appears in geomechanical modeling. This poroelasticity problem suffers from rapidly oscillating material parameters, which calls for a thorough…
Let $E/F$ be a quadratic extension of local nonarchimedean fields of characteristic zero and let $D$ be a quaternion algebra over $F$ containing $E$. In this paper, we study a relation between the existence of twisted linear models on…
We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…
A vertex-transitive graph X is called local-to-global rigid if there exists R such that every other graph whose balls of radius R are isometric to the balls of radius R in X is covered by X. Let $d\geq 4$. We show that the 1-skeleton of an…
Separation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a…
We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all…
We present an algorithm for the determination of the local symmetry group for arbitrary k-points in 3D Brillouin zones. First, we test our implementation against tabulated results available for standard high-symmetry points (given by…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…