相关论文: An extremum property characterizing the n-dimensio…

Consider a Poisson point process within a convex set in a Euclidean space. The Vietoris-Rips complex is the clique complex over the graph connecting all pairs of points with distance at most $\delta$. Summing powers of the volume of all…

Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

Suppose M is a closed submanifold in a Euclidean ball of sufficiently large dimension. We give an optimal bound on the normal curvatures, guaranteeing that M is a sphere. The border cases consist of Veronese embeddings of the four…

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

Let $M^d$ denote the $d$-dimensional Euclidean, hyperbolic, or spherical space. The $r$-dual set of given set in $M^d$ is the intersection of balls of radii $r$ centered at the points of the given set. In this paper we prove that for any…

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, in particular, their possible numbers of vertices and their diameters. Our main results include a quadratic bound on the diameter of axial 3-way…

A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…

We prove that with high probability, a uniform sample of $n$ points in a convex domain in $\mathbb{R}^d$ can be rounded to points on a grid of step size proportional to $1/n^{d+1+\epsilon}$ without changing the underlying chirotope…

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

Let $\Delta_k(n)$ denote the simplicial complex of $(k+1)$-crossing-free subsets of edges in $\binom{[n]}{2}$. Here $k,n\in \mathbb N$ and $n\ge 2k+1$. Jonsson (2003) proved that (neglecting the short edges that cannot be part of any…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…