Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T11:08:34.035Z Has data issue: false hasContentIssue false

The Upper-Bound Theorem for Families of Boxes in ℝd

Published online by Cambridge University Press:  21 December 2009

Jürgen Eckhoff
Affiliation:
Department of Mathematics, University College London, Gower Street, London, WC1E 6BT, England.
Get access

Abstract

Let be a family of axis-aligned parallelotopes, or boxes, in ℝd. Denote by fk () the number of subfamilies of of size k + 1 with non-empty intersection. In an earlier paper, the author proved that, if f0 () = n and fr() = 0, then fk() ≤ fk(n, d, r) for k = 1,…,r − 1, where fk(n, d, r) is some explicitly given number. The result is best possible for all k. Here it is shown that, if equality is attained for some such k, then equality is attained for each such k.

Information

Type
Research Article
Copyright
Copyright © University College London 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable