中文
相关论文

相关论文: The generic minimal rigidity of a partially triang…

200 篇论文

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…

概率论 · 数学 2021-06-01 Louigi Addario-Berry , Sanchayan Sen

A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…

度量几何 · 数学 2017-09-27 Derek Kitson , Rupert H. Levene

Let $\mathbb{S}_h$ denote a sphere with $h$ holes. Given a triangulation $G$ of a surface $\mathbb{M}$, we consider the question of when $G$ contains a spanning subgraph $H$ such that $H$ is a triangulated $\mathbb{S}_h$. We give a new…

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

几何拓扑 · 数学 2019-05-06 Senja Barthel

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

组合数学 · 数学 2026-01-19 Angelo El Saliby

A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called…

几何拓扑 · 数学 2007-05-23 J. Sawollek

We consider the problem of characterising the generic rigidity of bar-joint frameworks in $\mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu…

组合数学 · 数学 2022-12-09 James Cruickshank , Hakan Guler , Bill Jackson , Anthony Nixon

In this paper we consider min-max minimal surfaces in three-manifolds and prove some rigidity results. For instance, we prove that any metric on a 3-sphere which has scalar curvature greater than or equal to 6 and is not round must have an…

微分几何 · 数学 2019-12-19 F. C. Marques , A. Neves

A one-degree-of-freedom graph is a graph obtained from a minimally rigid graph in the plane and removing an edge. For such graph, the set of realisations with fixed edge length, modulo rotations and reflections, is an algebraic curve. The…

代数几何 · 数学 2026-03-13 Josef Schicho , Ayush Kumar Tewari , Audie Warren

The triangulations of a surface $\Sigma$ with a prescribed set of vertices can be endowed with a graph structure $\mathcal{F}(\Sigma)$. Its edges connect two triangulations that differ by a single arc. It is known that, when $\Sigma$ is a…

几何拓扑 · 数学 2021-09-14 Lionel Pournin , Zili Wang

Barnette and Edelson have shown that there are finitely many minimal triangulations of a connected compact 2-manifold M. Similar finiteness results are obtained for cellular partial triangulations that satisfy various girth inequality…

几何拓扑 · 数学 2024-12-10 Stephen C. Power

Any $n$-vertex $3$-graph with minimum codegree at least $\lfloor n/3\rfloor$ must have a spanning tight component, but immediately below this threshold it is possible for no tight component to span more than $\lceil 2n/3\rceil$ vertices.…

组合数学 · 数学 2018-11-28 Agelos Georgakopoulos , John Haslegrave , Richard Montgomery

We prove that for every graph $G$, given fixed locations for the vertices of $G$ in $\mathbb{Z}^3$, there is a three-dimensional grid-drawing of $G$ with one bend per edge. The best previous bound was three bends per edge.

计算几何 · 计算机科学 2016-06-30 David R. Wood

Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths…

离散数学 · 计算机科学 2023-06-22 Feodor F. Dragan , Abdulhakeem Mohammed

Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without…

离散数学 · 计算机科学 2015-05-19 Therese Biedl

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…

偏微分方程分析 · 数学 2025-11-04 Sedef Özcan

We prove that for any prime homology $(d-1)$-sphere $\Delta$ of dimension $d-1\geq 3$ and any edge $e\in S$, the graph $G(\Delta)-e$ is generically $d$-rigid. This confirms a conjecture of Nevo and Novinsky.

组合数学 · 数学 2017-04-13 Hailun Zheng

We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…

组合数学 · 数学 2016-07-08 Bill Jackson , Viktoria Kaszanitzky , Anthony Nixon

We investigate the geometric constraints imposed by low Morse index on minimal surfaces with Y-singularities, focusing on the classification of those with Morse index one. Our rigidity result establishes a partial uniqueness theorem,…

微分几何 · 数学 2025-09-30 Elham Matinpour

An ideal I is robust if its universal Gr\"obner basis is a minimal generating set for this ideal. In this paper, we generalize the meaning of robust ideals. An ideal is defined as generalized robust if its universal Gr\"obner basis is equal…

交换代数 · 数学 2018-10-30 Christos Tatakis