Related papers: The structure of rigid functions

We prove a structure theorem for stable functions on amenable groups, which extends the arithmetic regularity lemma for stable subsets of finite groups. Given a group $G$, a function $f\colon G\to [-1,1]$ is called stable if the binary…

Let $n\geq 1$, and let $\Omega\subset \mathbb{R}^n$ be an open and connected set with finite Lebesgue measure. Among functions of bounded variation in $\Omega$ we introduce the class of \emph{minimally singular} functions. Inspired by the…

A Finsler function $F$ is affinely rigid if its canonical spray is uniquely metrizable, in the sense that if $\bar F$ is another Finsler function whose canonical spray is $S$, then $d(F/\bar F)=0$. In this short note we explore some…

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.…

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

We introduce a geometric invariant, called finite decomposition complexity (FDC), to study topological rigidity of manifolds. We prove for instance that if the fundamental group of a compact aspherical manifold M has FDC, and if N is…

When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…

Results on the upper and lower semicontinuity of functionals defined on spaces of convex and more general functions are established. In particular, the following result is obtained. Let $\phi(v; \cdot)$ be the density of the absolutely…

In this work, we discuss the continuity of $h$-convex functions by introducing the concepts of $h$-convex curves ($h$-cord). Geometric interpretation of $h$-convexity is given. The fact that for a $h$-continuous function $f$, is being…

Let $f = f(z,t)$ be a function holomorphic in $z \in O \subseteq {\mathbb C}^d$ for fixed $t\in \Omega$ and measurable in $t$ for fixed $z$ and such that$z \mapsto f(z,\cdot)$ is bounded with values in$E := L_{p}(\Omega)$, $1\le p \le…

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 paper we prove a recursive characterisation of generic rigidity for frameworks periodic with respect to a partially variable lattice. We follow the approach of modelling periodic frameworks as frameworks on a torus and use the…

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…

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…

We prove an analytic version of the stable graph regularity lemma from \cite{MaSh}, which applies to stable functions $f\colon V\times W\to [0,1]$. Our methods involve continuous model theory and, in particular, results on the structure of…

In the present article we provide a sufficient condition for a closed set F in R^d to have the following property which we call c-removability: Whenever a function f:R^d->R is locally convex on the complement of F, it is convex on the whole…

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…

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…

We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…