Related papers: Volume of 4-polytopes from bivectors
Given an $n$-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/\log n)^n$. There is a substantial progress on randomized…
Intrinsic volumes are fundamental geometric invariants generalizing volume, surface area, and mean width for convex bodies. We establish a unified Laplace-Grassmannian representation for intrinsic and dual volumes of convex polynomial…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
In loop quantum gravity, states of quantum geometry are represented by classes of knotted graphs, equivalent under diffeomorphisms. Thus, it is worthwhile to enumerate and distinguish these classes. This paper looks at the case of 4-regular…
Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…
In this note we show the n-2-dimensional volumes of codimension 2 faces of an n-dimensional simplex are algebraically independent functions of the lengths of edges. In order to prove this we compute the complete spectrum of a…
In this paper, for each finite group $G$, we construct explicitly a non-compact complete finite-volume arithmetic hyperbolic $4$-manifold $M$ such that $\mathrm{Isom}\,M \cong G$, or $\mathrm{Isom}^{+}\,M \cong G$. In order to do so, we use…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
The volume conjecture states that for a hyperbolic knot K in the three-sphere S^3 the asymptotic growth of the colored Jones polynomial of K is governed by the hyperbolic volume of the knot complement S^3\K. The conjecture relates two…
We develop a Melnikov method for volume-preserving maps with codimension one invariant manifolds. The Melnikov function is shown to be related to the flux of the perturbation through the unperturbed invariant surface. As an example, we…
The aim of this paper is the determination of the largest $n$-dimensional polytope with $n+3$ vertices of unit diameter. This is a special case of a more general problem proposed by Graham.
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…
We have derived an analytical formulation for estimating the volume of geometries enclosed by implicitly defined surfaces. The novelty of this work is due to two aspects. First we provide a general analytical formulation for all…
A standard fact about two incompressible surfaces in an irreducible 3-manifold is that one can move one of them by isotopy so that their intersection becomes $\pi_1$-injective. By extending it on the maps of some 3-dimensional…
The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…
We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…
Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…
We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…