Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 208 / 3 / d / Solution

Exactly one lowest-numbered ball is selected in each occupied bin, so

\sum_{j = 1}^{m} α_{j} (x) = n - f (x) \leq n, \sum_{j = 1}^{m} α_{j} (x)^{2} \leq n .

Part c supplies the corresponding one-sided coordinate certificate. The product-space entropy method for certifiable functions states that a function with such a certificate of squared size at most

v

has both centered tails bounded by

e^{- t^{2} / (2 v)}

. Taking

v = n

gives

P (Z - E Z \geq t) \leq e^{- t^{2} / (2 n)}, P (Z - E Z \leq - t) \leq e^{- t^{2} / (2 n)} .

 Ancestors (11)

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version