Related papers: Minimal Face Numbers for Volume Rigidity

Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…

We design in this work a discrete de Rham complex on manifolds. This complex, written in the framework of exterior calculus, has the same cohomology as the continuous de Rham complex, is of arbitrary order of accuracy and, in principle, can…

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…

Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…

Let $(M,g_0)$ be a closed Riemannian manifold of dimension $n$, for $3 \leq n \leq 7$, and non-negative Ricci curvature. Let $g = \phi^2 g_0$ be a metric in the conformal class of $g_0$. We show that there exists a smooth closed embedded…

Let $B_n$ be the $n$-dimensional unit ball given by the inequality $\|x\|\leq 1$, where $\|x\|$ is the standard Euclid norm in ${\mathbb R}^n$. For an $n$-dimensional nondegenerate simplex $S$, we denote by $E$ the ellipsoid of minimum…

A bar framework determined by a finite graph $G$ and configuration $\bf p$ in $d$ space is universally rigid if it is rigid in any ${\mathbb R}^D \supset {\mathbb R}^d$. We provide a characterization of universally rigidity for any graph…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

For a metric space $(X, d)$ and a scale parameter $r \geq 0$, the Vietoris-Rips complex $\mathcal{VR}(X;r)$ is a simplicial complex on vertex set $X$, where a finite set $\sigma \subseteq X$ is a simplex if and only if diameter of $\sigma$…

A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…

The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph $H$ and $\varepsilon > 0$, if an $n$-vertex graph $G$ contains $\varepsilon n^2$ edge-disjoint copies of $H$ then $G$ contains…

Ivanov and Tuzhilin started an investigation of a particular case of Gromov Minimal Fillings problem (generalized to the case of stratified manifolds). Weighted graphs with non-negative weight function were used as minimal fillings of…

We establish conditions for a continuous map of nonzero degree between a smooth closed manifold and a negatively curved manifold of dimension greater than four to be homotopic to a smooth cover, and in particular a diffeomorphism when the…

Symmetry equations are obtained for the rigidity matrix of a bar-joint framework in R^d. These form the basis for a short proof of the Fowler-Guest symmetry group generalisation of the Calladine-Maxwell counting rules. Similar symmetry…

Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…

The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…

A $(d-1)$-dimensional simplicial complex $\Delta$ is balanced if its graph $G(\Delta)$ is $d$-colorable. Klee and Novik obtained the balanced lower bound theorem for balanced normal $(d-1)$-pseudomanifolds $\Delta$ with $d\geq3$ by showing…