English
Related papers

Related papers: Rigidity with few locations

200 papers

We prove rigidity results involving the Hawking mass for surfaces immersed in a $3$-dimensional, complete Riemannian manifold $(M,g)$ with non-negative scalar curvature (resp. with scalar curvature bounded below by $-6$). Roughly, the main…

Differential Geometry · Mathematics 2022-11-11 Andrea Mondino , Aidan Templeton-Browne

In this paper, we firstly establish a new volume growth estimate for spacelike entire graphs in the pseudo-Euclidean space $\mathbb{R}^{m+n}_n$. Then by using this volume growth estimate and the Co-Area formula, we prove various rigidity…

Differential Geometry · Mathematics 2020-04-16 Hongbing Qiu , Linlin Sun

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

Combinatorics · Mathematics 2009-10-31 B. Krön

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

Geometric Topology · Mathematics 2023-07-28 Yunhi Cho , Seonhwa Kim

A bar-joint framework $(G,p)$ in the Euclidean space $\mathbb{E}^d$ is globally rigid if it is the unique realisation, up to rigid congruences, of $G$ in $\mathbb{E}^d$ with the edge lengths of $(G,p)$. Building on key results of…

Combinatorics · Mathematics 2022-06-16 Sean Dewar , John Hewetson , Anthony Nixon

In this paper we have proved several approximation theorems for the family of minimal surfaces in R^3 that imply, among other things, that complete minimal surfaces are dense in the space of all minimal surfaces endowed with the topology of…

Differential Geometry · Mathematics 2007-05-23 A. Alarcon , L. Ferrer , F. Martin

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry…

Combinatorics · Mathematics 2010-07-28 Michel Deza , Mathieu Dutour Sikiric

We describe some topological structure in the set of all surfaces with finitely many singularities in the 3-sphere. As an application, we prove that every Riemannian 3-sphere of positive Ricci curvature contains, for every g, a genus g…

Differential Geometry · Mathematics 2025-08-11 Adrian Chun-Pong Chu

We prove that the space of circle packings consistent with a given triangulation on a surface of genus at least two is projectively rigid, so that a packing on a complex projective surface is not deformable within that complex projective…

Geometric Topology · Mathematics 2023-07-19 Francesco Bonsante , Michael Wolf

We show that a complete embedded maximal surface in the 3-dimensional Lorentz-Minkowski space $L^3$ with a finite number of singularities is, up to a Lorentzian isometry, an entire graph over any spacelike plane asymptotic to a vertical…

Differential Geometry · Mathematics 2007-05-23 Isabel Fernandez , Francisco J. Lopez , Rabah Souam

We consider the Erd\H{o}s-R\'enyi evolution of random graphs, where a new uniformly distributed edge is added to the graph in every step. For every fixed $d\ge 1$, we show that with high probability, the graph becomes rigid in $\mathbb R^d$…

Combinatorics · Mathematics 2022-09-14 Alan Lew , Eran Nevo , Yuval Peled , Orit E. Raz

The general position problem for graphs was inspired by the no-three-in-line problem from discrete geometry. A set $S$ of vertices of a graph $G$ is a \emph{general position set} if no shortest path in $G$ contains three or more vertices of…

Combinatorics · Mathematics 2024-04-02 Elias John Thomas , Ullas Chandran , James Tuite , Gabriele Di Stefano

The number of embeddings of minimally rigid graphs in $\mathbb{R}^D$ is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though various approaches have been proposed to compute it, the gap…

Algebraic Geometry · Mathematics 2020-01-24 Evangelos Bartzos , Ioannis Emiris , Jan Legerský , Elias Tsigaridas

Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…

Group Theory · Mathematics 2022-11-07 Timothy C. Burness , Andrea Lucchini , Daniele Nemmi

We study the rigidity of compact submanifolds of Riemannian manifolds of arbitrary codimension that satisfy a sharp pinching condition involving the norm of the second fundamental form and the mean curvature. Without assuming that the…

Differential Geometry · Mathematics 2026-03-25 Theodoros Vlachos

We show that there exist linear $3$-uniform hypergraphs with $n$ vertices and $\Omega(n^2)$ edges which contain no copy of the $3 \times 3$ grid. This makes significant progress on a conjecture of F\"{u}redi and Ruszink\'{o}. We also…

Combinatorics · Mathematics 2021-04-02 Lior Gishboliner , Asaf Shapira

Let $P \subset \R^3$ be a polyhedron. It was conjectured that if $P$ is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. $P$ can be triangulated without adding new vertices), then it…

Differential Geometry · Mathematics 2010-10-19 Ivan Izmestiev , Jean-Marc Schlenker

Given a compact 3-manifold N without boundary, we prove that for a bumpy metric of positive scalar curvature the space of minimal surfaces having a uniform upper bound on the Morse index is always finite unless the manifold itself contains…

Differential Geometry · Mathematics 2016-06-14 Alessandro Carlotto

A \textit{diameter graph in $\mathbb R^d$} is a graph, whose set of vertices is a finite subset of $\mathbb R^d$ and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of…

Combinatorics · Mathematics 2017-12-01 Andrey Kupavskii

The irregularity strength of a graph $G$, $s(G)$, is the least $k$ such that there exists a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ attributing distinct weighted degrees to all vertices, or equivalently the least $k$ enabling…

Combinatorics · Mathematics 2024-06-17 Jakub Przybyło