The Kissing Number Problem: A New Result from Global Optimization

2004 ◽  
Vol 17 ◽  
pp. 203-207 ◽  
Author(s):  
Leo Liberti ◽  
Nelson Maculan ◽  
Sergei Kucherenko
2018 ◽  
Vol 28 (1) ◽  
pp. 100-129 ◽  
Author(s):  
JIANGE LI ◽  
MOKSHAY MADIMAN

Small ball inequalities have been extensively studied in the setting of Gaussian processes and associated Banach or Hilbert spaces. In this paper, we focus on studying small ball probabilities for sums or differences of independent, identically distributed random elements taking values in very general sets. Depending on the setting – abelian or non-abelian groups, or vector spaces, or Banach spaces – we provide a collection of inequalities relating different small ball probabilities that are sharp in many cases of interest. We prove these distribution-free probabilistic inequalities by showing that underlying them are inequalities of extremal combinatorial nature, related among other things to classical packing problems such as the kissing number problem. Applications are given to moment inequalities.


2007 ◽  
Vol 155 (14) ◽  
pp. 1837-1841 ◽  
Author(s):  
Sergei Kucherenko ◽  
Pietro Belotti ◽  
Leo Liberti ◽  
Nelson Maculan

Author(s):  
Reiner Horst ◽  
Hoang Tuy
Keyword(s):  

Informatica ◽  
2016 ◽  
Vol 27 (2) ◽  
pp. 323-334 ◽  
Author(s):  
James M. Calvin

2013 ◽  
Vol 32 (4) ◽  
pp. 981-985
Author(s):  
Ya-fei HUANG ◽  
Xi-ming LIANG ◽  
Yi-xiong CHEN

Sign in / Sign up

Export Citation Format

Share Document