Related papers: The rigidity of periodic frameworks as graphs on a…
We introduce the notion of rigidity for automorphic representations of groups over global function fields. We construct the Langlands parameters of rigid automorphic representations explicitly as local systems over open curves. We expect…
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…
This paper introduces new structures called conic frameworks and their rigidity. They are composed by agents and a set of directed constraints between pairs of agents. When the structure cannot be flexed while preserving the constraints, it…
A toroidal grid graph is a Cartesian product of cycles, and the run length of a Hamiltonian cycle in a grid graph is defined to be the maximum number r such that any r consecutive edges include no more than one edge in any dimension. By…
We present an overview of some recent developments in the theory of generalized formal series, grounded in diffeological geometric framework. These constructions aim to offer new tools for understanding infinite-dimensional phenomena in…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
We present a rigorous study of framework rigidity in general finite dimensional normed spaces from the perspective of Lie group actions on smooth manifolds. As an application, we prove an extension of Asimow and Roth's 1978/9 result…
In this paper, we introduce the concept of monotone Gregus-\'Ciri\'c-contraction mappings in weighted digraphs. Then we establish a fixed point theorem for monotone Gregus-\'Ciri\'c-contraction mappings defined in convex weighted digraphs.
A function $f:\RR^n \to \RR$ is called \emph{vertically rigid} if $graph(cf)$ is isometric to $graph (f)$ for all $c \neq 0$. We settled Jankovi\'c's conjecture in a separate paper by showing that a continuous function $f:\RR \to \RR$ is…
In this article, we introduce the notion of periodic de Rham bundles over smooth complex curves. We prove that motivic de Rham bundles over smooth complex curves are periodic. We conjecture that irreducible periodic de Rham bundles over…
This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary,…
Trophic coherence, a measure of a graph's hierarchical organisation, has been shown to be linked to a graph's structural and dynamical aspects such as cyclicity, stability and normality. Trophic levels of vertices can reveal their…
Let $(X,d)$ be a nonempty metric space and let $n\in \mathbb N^+$. We shall say that $T\colon X\to X$ is a graphic contraction of order $n$ if there exists $\alpha\in (0,1)$ such that the inequality $$ d(T^n x,T^{2n}x) \leqslant \alpha…
In the article, we exhibit a series of new examples of rigid plane curves, that is, curves, whose collection of singularities determines them almost uniquely up to a projective transformation of the plane.
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 characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…