Related papers: Generic Global Rigidity in Complex and Pseudo-Eucl…
In this paper, we characterize round spheres in the Euclidean space under some suitable conditions on the r-mean curvature.
We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…
We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…
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…
In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…
The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…
Consider a network with $N$ nodes in $d$-dimensional Euclidean space, and $M$ subsets of these nodes $P_1,\cdots,P_M$. Assume that the nodes in a given $P_i$ are observed in a local coordinate system. The registration problem is to compute…
We give an algebraic characterization of when a $d$-dimensional periodic framework has no non-trivial, symmetry preserving, motion for any choice of periodicity lattice. Our condition is decidable, and we provide a simple algorithm that…
Graph rigidity theory studies the capability of a graph embedded in the Euclidean space to constrain its global geometric shape via local constraints among nodes and edges, and has been widely exploited in network localization and formation…
We give an explicit construction of global Galois gerbes constructed more abstractly by Kaletha to define global rigid inner forms. This notion is crucial to formulate Arthur's multiplicity formula for inner forms of quasi-split reductive…
For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…
We study the maximum dimension $d=d(n,p)$ for which an Erd\H{o}s-R\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\log n/n,~C_*=2/(1-\log 2)$ -- the point…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…
We consider a class of overdetermined problems in rotationally symmetric spaces, which reduce to the classical Serrin's overdetermined problem in the case of the Euclidean space. We prove some general integral identities for rotationally…
The Newlander-Nirenberg theorem says that a formally integrable complex structure is locally equivalent to the standard complex structure in the complex Euclidean space. In this paper, we consider two natural generalizations of the…
Under normal circumstances most members of the general relativity community focus almost exclusively on the local properties of spacetime, such as the locally Euclidean structure of the manifold and the Lorentzian signature of the metric…
Spatial networks are networks whose graph topology is constrained by their embedded spatial space. Understanding the coupled spatial-graph properties is crucial for extracting powerful representations from spatial networks. Therefore,…
Let $V$ be a finite-dimensional unitary representation of a compact quantum group $\mathrm{G}$ and denote by $\mathrm{G}_W$ the isotropy subgroup of a linear subspace $W\le V$ regarded as a point in the Grassmannian $\mathbb{G}(V)$. We show…
The problem of finding the general classification of geodetic graphs is still open. We believe that one of the obstacles to attain this goal is that geodetic graphs lack a structural description. In other words, their fundamental properties…
Hierarchical data is common in many domains like life sciences and e-commerce, and its embeddings often play a critical role. While hyperbolic embeddings offer a theoretically grounded approach to representing hierarchies in low-dimensional…