Related papers: Normal-sized hypercuboids in a given hypercube
The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for the hypercube. We generalize this result to give sharp lower…
We prove that any graph of multicurves satisfying certain natural properties is either hyperbolic, relatively hyperbolic, or thick. Further, this geometric characterization is determined by the set of subsurfaces that intersect every vertex…
We consider two types of problems: maximising, over subsets $S\subseteq \{0,1\}^n$, the density of $d$-subcubes $C$ in the $n$-hypercube graph that span a subgraph such that $S\cap C$ is i) isomorphic to the given configuration…
We find the asymptotic behavior of the Steiner k-diameter of the $n$-cube if $k$ is large. Our main contribution is the lower bound, which utilizes the probabilistic method.
In this article we explore the relationship between the systole and the diameter of closed hyperbolic orientable surfaces. We show that they satisfy a certain inequality, which can be used to deduce that their ratio has a (genus dependent)…
We give upper and lower bounds for the ratio of the volume of metric ball to the area of the metric sphere in Finsler-Hadamard manifolds with pinched S-curvature. We apply these estimates to find the limit at the infinity for this ratio.…
In this paper we continue our study of finding the curvature flow of complete hypersurfaces in hyperbolic space with a prescribed asymptotic boundary at infinity. Our main results are proved by deriving a priori global gradient estimates…
We study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges but with different edge sizes. For the case of two overlapping…
It is shown that a hypersurface of a space form is the initial data for a solution to the mean curvature flow by parallel hypersurfaces if, and only if, it is isoparametric. By solving an ordinary differential equation, explicit solutions…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
We derive bounds on the volume of an inclusion in a body in two or three dimensions when the conductivities of the inclusion and the surrounding body are complex and assumed to be known. The bounds are derived in terms of average values of…
We consider the mean curvature flow of a closed hypersurface in the complex or quaternionic projective space. Under a suitable pinching assumption on the initial data, we prove apriori estimates on the principal curvatures which imply that…
The paper addresses the numerical approximation of two variants of hyperbolic mean curvature flow of surfaces in $\mathbb R^3$. For each evolution law we propose both a finite element method, as well as a finite difference scheme in the…
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…
In this paper we investigate the convergence for the mean curvature flow of closed submanifolds with arbitrary codimension in space forms. Particularly, we prove that the mean curvature flow deforms a closed submanifold satisfying a…
We find complete hypersurfaces of constant curvature in hyperbolic space with a prescribed asymptotic boundary at infinity for a general class of (elliptic) curvature functions which includes the higher order mean curvatures and their…
We show that the d-cube is determined by the spectrum of its distance matrix.
We give an estimate of the mean curvature of a complete submanifold lying inside a closed cylinder $B(r)\times\R^{\ell}$ in a product Riemannian manifold $N^{n-\ell}\times\R^{\ell}$. It follows that a complete hypersurface of given constant…
We describe a uniformly fast algorithm for generating points \vec{x} uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its…