The average kissing number in $${\mathbb{R}^n}$$ is the supremum of degrees contact graphs packings finitely many balls (of any radii) . We provide an upper bound for based on semidefinite programming that improves previous bounds dimensions 3,..., 9. A very simple twice number; 6,..., 9 our new first to improve this bound.

We argue that analysing schemes for metrology solely in terms of the average particle number can obscure particles effectively used informative events. For a states we demonstrate that, both frequentist and Bayesian frameworks, state essentially be decoupled from aspects total distribution associated with any metrological advantage.