中文
相关论文

相关论文: Characterizing Generic Global Rigidity

200 篇论文

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

组合数学 · 数学 2016-10-26 Huda Chuangpishit , Jeannette Janssen

The $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G=(V,E)$ is a quantitative measure of its $d$-dimensional rigidity, defined in terms of the eigenvalues of stiffness matrices associated with different embeddings of the graph…

组合数学 · 数学 2025-04-03 Yunseong Jung , Alan Lew

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

微分几何 · 数学 2016-03-22 Roberto Frigerio , Jean-Francois Lafont , Alessandro Sisto

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…

组合数学 · 数学 2011-09-06 Naoki Katoh , Shin-ichi Tanigawa

While the problem of determining whether an embedding of a graph $G$ in $\mathbb{R}^2$ is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G$ is {\it rigid} or not is still a hard task that usually…

组合数学 · 数学 2019-01-31 Orit E. Raz , József Solymosi

How does one determine if a collection of bars joined by freely rotating hinges cannot be deformed without changing the length of any of the bars? In other words, how does one determine if a bar-joint graph is rigid? This question has been…

无序系统与神经网络 · 物理学 2024-10-02 Kyungeun Kim , J. M. Schwarz

A bar-and-joint framework is a finite set of points together with specified distances between selected pairs. In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points…

组合数学 · 数学 2013-08-16 Christopher Clement , Audrey Lee-St. John , Jessica Sidman

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

组合数学 · 数学 2024-10-04 Wei Wang , Wei Wang , Fuhai Zhu

In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…

组合数学 · 数学 2017-05-17 Daniela Kühn , Allan Lo , Deryk Osthus , Katherine Staden

We prove that for $d\geq 3$, the 1-skeleton of any $(d-1)$-dimensional doubly Cohen Macaulay (abbreviated 2-CM) complex is generically $d$-rigid. This implies the following two corollaries (by Kalai and Lee respectively): Barnette's lower…

组合数学 · 数学 2008-09-05 Eran Nevo

Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…

组合数学 · 数学 2018-06-14 Xiaofeng Gu

A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…

组合数学 · 数学 2014-10-22 Wei Wang

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 set of vertices of a graph is said to be in general position if no three vertices from the set lie on a common geodesic. Recently Klav\v{z}ar, Rall and Yero generalized this notion by defining a set of vertices to be in general…

组合数学 · 数学 2024-09-10 Brent Cody , Garrett Moore

We characterise finite and infinitesimal rigidity for bar-joint frameworks in R^d with respect to polyhedral norms (i.e. norms with closed unit ball P a convex d-dimensional polytope). Infinitesimal and continuous rigidity are shown to be…

度量几何 · 数学 2014-01-08 D. Kitson

Frames are the most natural generalization of orthonormal bases that allow the inclusion of redundant systems. In this article, we introduce the concept of frames generated by graphs in finite-dimensional spaces and study their properties.…

泛函分析 · 数学 2024-05-28 Deepshikha

As we add rigid bars between points in the plane, at what point is there a giant (linear-sized) rigid component, which can be rotated and translated, but which has no internal flexibility? If the points are generic, this depends only on the…

组合数学 · 数学 2012-07-27 Shiva Prasad Kasiviswanathan , Cristopher Moore , Louis Theran

This paper introduces a geometric mechanics framework for constrained systems on principal bundles through \emph{compatible pairs} $(\mathcal{D}, \lambda)$, addressing fundamental challenges in gauge-constrained physical systems. We…

综合数学 · 数学 2025-08-12 Dongzhe Zheng

We develop, in the context of general relativity, the notion of a geoid -- a surface of constant "gravitational potential". In particular, we show how this idea naturally emerges as a specific choice of a previously proposed, more general…

广义相对论与量子宇宙学 · 物理学 2016-06-10 Marius Oltean , Richard J. Epp , Paul L. McGrath , Robert B. Mann

Graphs triangulating the $2$-sphere are generically rigid in $3$-space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset $A$ in $3$-space so that the vertices of each graph $G$ as above can be mapped into $A$ to…

组合数学 · 数学 2019-12-03 Karim Adiprasito , Eran Nevo