Skip to main content

Distributions of Points in d Dimensions and Large k-Point Simplices

Extended Abstract

  • Conference paper
Computing and Combinatorics (COCOON 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3595))

Included in the following conference series:

  • 1876 Accesses

Abstract

We consider a variant of Heilbronn’s triangle problem by asking for fixed dimension d ≥ 2 and for fixed integers k ≥ 3 with kd+1 for a distribution of n points in the d-dimensional unit-cube [0,1]d such that the minimum volume of a k-point simplex among these n points is as large as possible. Denoting by Δ k,d (n) the supremum of the minimum volume of a k-point simplex among n points over all distributions of n points in [0,1]d we will show that c k . (log n)1/( d − − k + 2)/n (k − − 1)/(d − − k + 2) ≤ Δ k,d (n) ≤ c k ′/n (k − − 1)/d for 3 ≤ kd +1, and moreover Δ k,d (n) ≤ c k ′′/n (k − − 1)/d + (k − − 2)/(2d(d− − 1)) for k ≥ 4 even, and constants c k , c k ′, c k ′′ > 0.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ajtai, M., Komlós, J., Pintz, J., Spencer, J., Szemerédi, E.: Extremal Uncrowded Hypergraphs. Journal of Combinatorial Theory Ser. A 32, 321–335 (1982)

    Article  MATH  Google Scholar 

  2. Barequet, G.: A Lower Bound for Heilbronn’s Triangle Problem in d Dimensions. SIAM Journal on Discrete Mathematics 14, 230–236 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Barequet, G.: The On-Line Heilbronn’s Triangle Problem in Three and Four Dimensions. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 360–369. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Bertram–Kretzberg, C., Lefmann, H.: The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM Journal on Computing 29, 201–230 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bertram-Kretzberg, C., Hofmeister, T., Lefmann, H.: An Algorithm for Heilbronn’s Problem. SIAM Journal on Computing 30, 383–390 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brass, P.: An Upper Bound for the d-Dimensional Heilbronn Triangle Problem. SIAM Journal on Discrete Mathenmatics (to appear)

    Google Scholar 

  7. Duke, R.A., Lefmann, H., Rödl, V.: On Uncrowded Hypergraphs. Random Structures & Algorithms 6, 209–212 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jiang, T., Li, M., Vitany, P.: The Average Case Area of Heilbronn-type Triangles. Random Structures & Algorithms 20, 206–219 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Komlós, J., Pintz, J., Szemerédi, E.: On Heilbronn’s Triangle Problem. Journal of the London Mathematical Society 24, 385–396 (1981)

    Article  MATH  Google Scholar 

  10. Komlós, J., Pintz, J., Szemerédi, E.: A Lower Bound for Heilbronn’s Problem. Journal of the London Mathematical Society 25, 13–24 (1982)

    Article  MATH  Google Scholar 

  11. Lefmann, H.: On Heilbronn’s Problem in Higher Dimension. Combinatorica 23, 669–680 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lefmann, H.: Large Triangles in the d-Dimensional Unit-Cube. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 43–52. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Lefmann, H.: Distributions of Points in the Unit-Square and Large k-Gons. In: Proc. 16th Symposium on Discrete Algorithms SODA 2005, pp. 241–250. ACM /SIAM (2005)

    Google Scholar 

  14. Lefmann, H., Schmitt, N.: A Deterministic Polynomial Time Algorithm for Heilbronn’s Problem in Three Dimensions. SIAM Journal on Computing 31, 1926–1947 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Roth, K.F.: On a Problem of Heilbronn. Journal of the London Mathematical Society 26, 198–204 (1951)

    Article  MATH  Google Scholar 

  16. Roth, K.F.: On a Problem of Heilbronn, II and III. Proc. of the London Mathematical Society 25(3), 193–212, 543–549 (1972)

    Article  MATH  Google Scholar 

  17. Roth, K.F.: Estimation of the Area of the Smallest Triangle Obtained by Selecting Three out of n Points in a Disc of Unit Area. In: Proc. of Symposia in Pure Mathematics, vol. 24, pp. 251–262. AMS, Providence (1973)

    Google Scholar 

  18. Roth, K.F.: Developments in Heilbronn’s Triangle Problem. Advances in Mathematics 22, 364–385 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  19. Schmidt, W.M.: On a Problem of Heilbronn. Journal of the London Mathematical Society 4(2), 545–550 (1972)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lefmann, H. (2005). Distributions of Points in d Dimensions and Large k-Point Simplices. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_52

Download citation

  • DOI: https://doi.org/10.1007/11533719_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28061-3

  • Online ISBN: 978-3-540-31806-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics