Related papers: Minimal Face Numbers for Volume Rigidity
We present a rigorous study of framework rigidity in general finite dimensional normed spaces from the perspective of Lie group actions on smooth manifolds. As an application, we prove an extension of Asimow and Roth's 1978/9 result…
In this paper we generalize the main result of [4] for manifolds that are not necessarily Einstein. In fact, we obtain an upper bound for the volume of a locally volume-minimizing closed hypersurface $\Sigma$ of a Riemannian 5-manifold $M$…
The conditioning of the linear finite volume element discretization for general diffusion equations is studied on arbitrary simplicial meshes. The condition number is defined as the ratio of the maximal singular value of the stiffness…
We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of…
This work presents a Discrete de Rham (DDR) numerical scheme for solving linear elasticity problems on general polyhedral meshes, with a focus on preventing volumetric locking in the quasi-incompressible regime. The method is formulated as…
Jord\'an and Tanigawa recently introduced the $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G$. This is a quantitative measure of the $d$-dimensional rigidity of $G$ which generalizes the well-studied notion of spectral…
In this paper, we prove a dihedral extremality and rigidity theorem for a large class of codimension zero submanifolds with polyhedral boundary in warped product manifolds. We remark that the spaces considered in this paper are not…
Let $V$ be a smooth projective 3-fold of general type. Denote by $K^{3}$, a rational number, the self-intersection of the canonical sheaf of any minimal model of $V$. One defines $K^{3}$ as a canonical volume of $V$. The paper is devoted to…
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…
Let $M$ be the interior of a connected, oriented, compact manifold $V$ of dimension at least 2. If each path component of $\partial V$ has amenable fundamental group, then we prove that the simplicial volume of $M$ is equal to the relative…
Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…
Small covers arising from 3-dimensional simple polytopes are an interesting class of 3-manifolds. The fundamental group is a rigid invariant for wide classes of 3-manifolds, particularly for orientable Haken manifolds, which include…
We study the rigidity of body-and-cad frameworks which capture the majority of the geometric constraints used in 3D mechanical engineering CAD software. We present a combinatorial characterization of the generic minimal rigidity of a subset…
For all nonsingular projective $n$-folds $V$ of general type, we prove the existence of Noether type inequalities in the following form: $$\text{vol}(V)\geq a_{n,k}h^0(\Omega_V^k)-b_{n,k}$$ where $0< k\leq n$, $a_{n,k}$ and $b_{n,k}$ are…
We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…
A facet of an hyperplane arrangement is called external if it belongs to exactly one bounded cell. The set of all external facets forms the envelope of the arrangement. The number of external facets of a simple arrangement defined by $n$…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…
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…
Mader conjectured in 1979 that an average degree of at least $3k-1$ in a graph is sufficient for the existence of a $(k+1)$-connected subgraph. The following minimum degree analogue holds: Every graph with minimum degree at least $3k-1$…
We prove an existence theorem for the sliding boundary variant of the Plateau problem for $2$-dimensional sets in $\mathbb{R}^n$. The simplest case of sufficient condition is when $n=3$ and the boundary $\Gamma$ is a finite disjoint union…