Related papers: Normal-sized hypercuboids in a given hypercube
In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in…
We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…
In this work we investigate the following isoperimetric problem: to find the regions of prescribed volume with minimal boundary area between two parallel horospheres in hyperbolic 3-space (the area of the part of the boundary contained in…
It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
The ratio of volume to crossing number of a hyperbolic knot is known to be bounded above by the volume of a regular ideal octahedron, and a similar bound is conjectured for the knot determinant per crossing. We investigate a natural…
The formula for the area of a rhumb polygon, a polygon whose edges are rhumb lines on an ellipsoid of revolution, is derived and a method is given for computing the area accurately. This paper also points out that standard methods for…
We investigate the problem of finding smooth hypersurfaces of constant mean curvature in hyperbolic space, which can be represented as radial graphs over a subdomain of the upper hemisphere. Our approach is variational and our main results…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
We utilize ideal bipyramids to obtain new upper bounds on volume for hyperbolic link complements in terms of the combinatorics of their projections.
In a variety of settings we provide a method for decomposing a 3-manifold $M$ into pieces. When the pieces have the appropriate type of hyperbolicity, then the manifold $M$ is hyperbolic and its volume is bounded below by the sum of the…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
Analytic relations are derived for finite volume integrals over the radial distribution function of a fluid, so-called Kirkwood-Buff integrals. Closed form expressions are obtained for cubes and cuboids, the system shapes commonly employed…
We study the principal curvatures of properly embedded constant mean curvature hypersurfaces in the Anti-de Sitter space $\mathbb{H}^{n,1}$. We generalize the notion of convex hull and give an upper bound on the principal curvatures which…
We define and compute hyperbolic coordinates and associated foliations which provide a new way to describe the geometry of the standard map. We also identify a uniformly hyperbolic region and a complementary 'critical' region containing a…
In this paper we study the symmetry parameters determining number, distinguishing number, and cost of 2-distinguishing, for some variations on hypercubes, namely Hamming graphs, powers of hypercubes, folded hypercubes, enhanced hypercubes,…
The volume of a line bundle is defined in terms of a limsup. It is a fundamental question whether this limsup is a limit. It has been shown that this is always the case on generically reduced schemes. We show that volumes are limits in two…
This chapter discusses a general design approach to planning computer experiments, which seeks design points that fill a bounded design region as uniformly as possible. Such designs are broadly referred to as space-filling designs.
The authors showed in a preceding paper that in a connected locally harmonic manifold, the volume of a tube of small radius about a regularly parameterized simple arc depends only on the length of the arc and the radius. In this paper, we…
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…