Related papers: The asymptotic diameter of cyclohedra
Exact results are given for the fourth virial coefficient of hard spheres in even dimensions up through 12. The fifth and sixth virial coefficients are numerically computed for dimensions 2 through 50 and it is found that the sixth virial…
We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…
Expected mean angular diameters and amplitudes of angular diameter variations are estimated for all monoperiodic Classical Cepheids brighter than <V> = 8.0mag. The catalog is intended to help selecting best Cepheid targets for…
We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…
For three dimensional complete Riemannian manifolds with scalar curvature no less than one, we obtain the sharp upper bound of complete stable minimal surfaces' diameter.
{\bf Abstract.} Let $D$ be a convex body of diameter $\delta$, where $0 < \delta < \frac{\pi}{2}$, on the $d$-dimensional sphere. We prove that $D$ is of constant diameter $\delta$ if and only if it is of constant width $\delta$ in the…
The (combinatorial) diameter of a polytope $P \subseteq \mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of…
A well-known theorem of S. Smirnov states that the Hausdorff dimension of a $k$-quasicircle is at most $1+k^2$. Here, we show that the precise upper bound $D(k) = 1+\Sigma^2 k^2 + \mathcal O(k^{8/3-\varepsilon})$ where $\Sigma^2$ is the…
Both the combinatorial and the circuit diameters of polyhedra are of interest to the theory of linear programming for their intimate connection to a best-case performance of linear programming algorithms. We study the diameters of dual…
This paper builds one-cusped complex hyperbolic $2$-manifolds by an explicit geometric construction. Specifically, for each odd $d \ge 1$ there is a smooth projective surface $Z_d$ with $c_1^2(Z_d) = c_2(Z_d) = 6d$ and a smooth irreducible…
We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when the dimension is allowed to grow with the…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
This article focuses on the problem of analytically determining the optimal placement of five points on the unit sphere $\mathbb{S}^2$ so that the surface area of the convex hull of the points is maximized. It is shown that the optimal…
The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…
In this paper we consider the convex hull of a spherically symmetric sample in $R^d$. Our main contributions are some new asymptotic results for the expectation of the number of vertices, number of facets, area and the volume of the convex…
In this article, we describe symplectic and complex toric spaces associated to the five regular convex polyhedra. The regular tetrahedron and the cube are rational and simple, the regular octahedron is not simple, the regular dodecahedron…
We show that the asymptotic dimension of a geodesic space that is homeomorphic to a subset in the plane is at most three. In particular, the asymptotic dimension of the plane and any planar graph is at most three.
We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction.…
In 1996 I.Kh. Sabitov proved that the volume of a simplicial polyhedron in a 3-dimensional Euclidean space is a root of certain polynomial with coefficients depending on the combinatorial type and on edge lengths of the polyhedron only.…
We show that the spectral dimension on non-generic branched polymers with positive susceptibility exponent is given by $d_s=2/(1+\gamma)$. For those models with $\gamma<0$ we find that $d_s=2$.