  
  
Stat 
Members: 2981 Articles: 2'033'011 Articles rated: 2577
25 January 2021 

   

Article overview
 

The AverageCase Area of HeilbronnType Triangles  Tao Jiang
; Ming Li
; Paul Vitanyi
;  Date: 
5 Feb 1999  Journal:  T. Jiang, M. Li, and P. Vitanyi, The averagecase area of Heilbronntype triangles, Random Structures and Algorithms, 20:2(2002), 206219  Subject:  Combinatorics; Logic; Metric Geometry; Probability; Computational Geometry; Discrete Mathematics MSCclass: 52C10  math.CO cs.CG cs.DM math.LO math.MG math.PR  Affiliation:  UCR), Ming Li (UCSB), Paul Vitanyi (CWI and U Amsterdam  Abstract:  From among $ {n choose 3}$ triangles with vertices chosen from $n$ points in the unit square, let $T$ be the one with the smallest area, and let $A$ be the area of $T$. Heilbronn’s triangle problem asks for the maximum value assumed by $A$ over all choices of $n$ points. We consider the averagecase: If the $n$ points are chosen independently and at random (with a uniform distribution), then there exist positive constants $c$ and $C$ such that $c/n^3 < mu_n < C/n^3$ for all large enough values of $n$, where $mu_n$ is the expectation of $A$. Moreover, $c/n^3 < A < C/n^3$, with probability close to one. Our proof uses the incompressibility method based on Kolmogorov complexity; it actually determines the area of the smallest triangle for an arrangement in ``general position.’’  Source:  arXiv, math.CO/9902043  Services:  Forum  Review  PDF  Favorites 


No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser CCBot/2.0 (https://commoncrawl.org/faq/)

 



 News, job offers and information for researchers and scientists:
 