相关论文: A quadratic lower bound for colourful simplicial d…

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

This paper studies the minimal number of vertices $\lambda(n,d)$ required in a triangulation of the $n$-sphere to admit a simplicial map to the boundary of a $(n+1)$-simplex with a given degree $d$. We establish upper bounds for…

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…

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.

We show that every planar convex body is contained in a quadrangle whose area is less than $(1 - 2.6 \cdot 10^{-7}) \sqrt{2}$ times the area of the original convex body, improving the best known upper bound by W. Kuperberg.

The new result of this paper connected with the following problem: Consider a supporting hyperplane of a regular simplex and its re ected image at this hyperplane. When will be the volume of the convex hull of these two simplices maximal?…

In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+\alpha$ vertices and $d+1+\beta$ facets is bounded by a constant independent of $d$.

Starting with a finite point set $X \subset \mathbf{R}^d$, the peeling process repeatedly removes the set of the vertices of the convex hull of the current set. The number of peeling steps required to completely remove $X$ is called the…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

Motivated by previous efforts toward mathematically analyzing the treatment of monomials in spatial branch-and-bound, we study the convex hull of the graph of a simple monomial on a nonnegative box domain in arbitrary dimension, where at…

We prove that for $n>3$ each generic simple polytope in $\mathbb{R}^n$ contains a point with at least $2n+4$ emanating normals to the boundary. This result is a piecewise-linear counterpart of a long-standing problem about normals to smooth…

We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new…

We consider the hypergraph Tur\'an problem of determining $\mathrm{ex}(n, S^d)$, the maximum number of facets in a $d$-dimensional simplicial complex on $n$ vertices that does not contain a simplicial $d$-sphere (a homeomorph of $S^d$) as a…

We extend the results of Bey, Hen, and Wills (http://arxiv.org/abs/math/0606089). In this paper, we show that, up to equivalence under unimodular transformations, there is exactly one class of $d$-simplices having $k \ge 1$ interior lattice…

Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth…