Related papers: Normal-sized hypercuboids in a given hypercube
Various authors have calculated how many pairwise incomparable points can be selected from a partially ordered set. We tackle this question for the family of subsets of a finite set obtained by removing or adding a bounded number of…
Consider a $d$-dimensional closed ball $B$ whose center coincides with that of the hypercube $[0,1]^d$. Pick the radius of $B$ in such a way that the vertices of the hypercube are outside of $B$ and the midpoints of its edges in the…
Over an infinite field $K$, we investigate the minimal free resolution of some configurations of lines. We explicitly describe the minimal free resolution of "complete grids of lines" and obtain an analogous result about the so-called…
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…
We consider a mean curvature flow in a cone, that is, a hypersurface in a cone which moves toward the opening with normal velocity equaling to the mean curvature, and the contact angle between the hypersurface and the cone boundary being…
We prove a central limit theorem for the volume of projections of the N-cube onto a random subspace of dimension n, when n is fixed and N tends to infinity. Randomness in this case is with respect to the Haar measure on the Grassmannian…
The cognitive framework of conceptual spaces [3] provides geometric means for representing knowledge. A conceptual space is a high-dimensional space whose dimensions are partitioned into so-called domains. Within each domain, the Euclidean…
We describe local similarities and global differences between minimal surfaces in Euclidean 3-space and constant mean curvature 1 surfaces in hyperbolic 3-space. We also describe how to solve global period problems for constant mean…
The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the…
The metric (resp. edge metric or mixed metric) dimension of a graph $G$, is the cardinality of the smallest ordered set of vertices that uniquely recognizes all the pairs of distinct vertices (resp. edges, or vertices and edges) of $G$ by…
Consider the hyperplanes at a fixed distance $t$ from the center of the hypercube $[0,1]^d$. Significant attention has been given to determining the hyperplanes $H$ among these such that the $(d-1)$-dimensional volume of $H\cap[0,1]^d$ is…
Gr\"unbaum's inequality gives sharp bounds between the volume of a convex body and its part cut off by a hyperplane through the centroid of the body. We provide a generalization of this inequality for hyperplanes that do not necessarily…
We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume noncentral sections of the cross-polypote by hyperplanes which are at a fixed large distance…
We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.
An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut…
Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. One of the most efficient interconnection networks is the hypercube due to its structural regularity, potential…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
We prove some results concerning the boundary of a convex set in $\H^n$. This includes the convergence of curvature measures under Hausdorff convergence of the sets, the study of normal points, and, for convex surfaces, a generalized Gauss…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
The oloid is the convex hull of two circles with equal radius in perpendicular planes so that the center of each circle lies on the other circle. We calculate the mean width of the oloid in two ways, first via the integral of mean…