A lower bound for Heilbronn's triangle problem in d dimensions

SIAM Journal on Discrete Mathematics

Volumn 14, Issue 2, 2001, Pages 230-236

  Barequet, Gill ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Johns Hopkins University   (United States)

Author keywords

Heilbronn's triangle problem; Probabilistic method

Indexed keywords

EID: 0012885377     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100365859     Document Type: Article

References (6)

1. J. CULBERSON, Mutation-crossover isomorphisms and the construction of discriminating functions, Evolutionary Comput., 2 (1995), pp. 279-311.
2. Y.H. KWONG, Minimum periods of binomial coefficients modulo M, Fibonacci Quart., 27 (1989), pp. 64-79.
3. J. LICHTNER, Iterating an α-ary Gray code, SIAM J. Discrete Math., 11 (1998), pp. 381-386.
4. B.D. SHARMA AND R.K. KHANNA, On m-ary Gray codes, Inform. Sci., 15 (1978), pp. 31-43.
5. m, SIAM J. Discrete Math., 9 (1996), pp. 55-62.
6. k), Ann. Univ. Mariae Curie-Sklodowska Sect. A, 10 (1956), pp. 37-47.