中文
相关论文

相关论文: Random points, convex bodies, lattices

200 篇论文

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

组合数学 · 数学 2007-05-23 Volker Kaibel , Marc E. Pfetsch

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

度量几何 · 数学 2025-03-31 Lenny Fukshansky

Let $T$ be the triangle in the plane with vertices $(0, 0)$, $(0,1)$ and $(0, 1)$. The convex hull $T_n$ of points $(0, 1)$, $(1, 0)$ and $n$ independent random points uniformly distributed in $T$ is the random convex chain. In this paper…

概率论 · 数学 2025-10-20 Anna Gusakova , Anna Muranova

J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and…

组合数学 · 数学 2010-10-20 Gregory S. Warrington

The $K$-hull of a compact set $A\subset\mathbb{R}^d$, where $K\subset \mathbb{R}^d$ is a fixed compact convex body, is the intersection of all translates of $K$ that contain $A$. A set is called $K$-strongly convex if it coincides with its…

度量几何 · 数学 2021-10-06 Alexander Marynych , Ilya Molchanov

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

度量几何 · 数学 2019-10-28 Jin-ichi Itoh , Costin Vîlcu , Liping Yuan , Tudor Zamfirescu

Pick $n$ points $Z_0,...,Z_{n-1}$ uniformly and independently at random in a compact convex set $H$ with non empty interior of the plane, and let $Q^n_H$ be the probability that the $Z_i$'s are the vertices of a convex polygon. Blaschke…

概率论 · 数学 2015-11-13 Jean-François Marckert

Suppose that $K \subseteq \RR^d$ is a 0-symmetric convex body which defines the usual norm $$ \Norm{x}_K = \sup\Set{t\ge 0: x \notin tK} $$ on $\RR^d$. Let also $A\subseteq\RR^d$ be a measurable set of positive upper density $\rho$. We show…

经典分析与常微分方程 · 数学 2007-05-23 Mihail N. Kolountzakis

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

计算几何 · 计算机科学 2018-01-11 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

In a $d$-dimensional convex body $K$, for $n \leq d+1$, random points $X_0, \dots, X_{n-1}$ are chosen according to the uniform distribution in $K$. Their convex hull is a random $(n-1)$-simplex with probability $1$. We denote its…

度量几何 · 数学 2017-06-23 Benjamin Reichenwallner

For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…

概率论 · 数学 2019-08-08 Friedrich Götze , Anna Gusakova , Dmitry Zaporozhets

We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…

数论 · 数学 2022-04-08 Jayadev S. Athreya , Cristian Cobeli , Alexandru Zaharescu

We show that there is no algorithm which, provided a polynomial number of random points uniformly distributed over a convex body in R^n, can approximate the volume of the body up to a constant factor with high probability.

概率论 · 数学 2012-11-27 Ronen Eldan

We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…

概率论 · 数学 2015-03-13 John Pardon

The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…

组合数学 · 数学 2013-12-24 Alexander Kelmans , Anatoliy Rubinov

It is conjectured since long that each smooth convex body $\mathbf{P}\subset \mathbb{R}^n$ has a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $\mathbf{P}$. The conjecture is proven…

度量几何 · 数学 2025-09-11 Ivan Nasonov , Gaiane Panina

Giving a joint generalization of a result of Brazitikos, Chasapis and Hioni and results of Giannopoulos and Milman, we prove that roughly $\left\lceil \frac{d}{(1-\vartheta)^d}\ln\frac{1}{(1-\vartheta)^d} \right\rceil$ points chosen…

度量几何 · 数学 2017-05-23 Márton Naszódi

In the first part of this paper, we obtain symmetric formulae for the probabilities that a plane convex body hits exactly 1, 2, 3, 4, 5 or 6 triangles of a lattice of congruent triangles in the plane. Furthermore, a very simple formula for…

概率论 · 数学 2015-01-08 Uwe Bäsel

We show that if $X$ is a totally real $d$-dimensional manifold attached to a polynomially convex compact set $K$ in $\mathbb{C}^n$, $d<n$, then there are arbitrarily small perturbations $X'$ of $X$ such that $K\cup X'$ is polynomially…

复变函数 · 数学 2025-10-15 Leandro Arosio , Håkan Samuelsson Kalm , Erlend F. Wold

We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…

统计理论 · 数学 2018-07-05 Victor-Emmanuel Brunel