A lower bound for the number of nodes in the cubature formula for a centrally symmetric integral

1989 ◽  
Vol 45 (5) ◽  
pp. 396-400 ◽  
Author(s):  
G. G. Rasputin
2019 ◽  
Vol 22 (04) ◽  
pp. 1950036
Author(s):  
Giorgos Chasapis ◽  
Apostolos Giannopoulos ◽  
Nikos Skarmogiannis

Let [Formula: see text] and [Formula: see text] be centrally symmetric convex bodies of volume 1 in [Formula: see text]. We provide upper bounds for the multi-integral expression [Formula: see text] in the case where [Formula: see text] is isotropic. Our approach provides an alternative proof of the sharp lower bound, due to Gluskin and Milman, for this quantity. We also present some applications to “randomized” vector balancing problems.


2018 ◽  
Vol 61 (3) ◽  
pp. 541-561 ◽  
Author(s):  
Steven Klee ◽  
Eran Nevo ◽  
Isabella Novik ◽  
Hailun Zheng

2021 ◽  
Vol 4 (3) ◽  
pp. 541-549
Author(s):  
Isabella Novik ◽  
Hailun Zheng

2019 ◽  
Vol 485 (2) ◽  
pp. 142-144
Author(s):  
A. A. Zevin

Solutions x(t) of the Lipschitz equation x = f(x) with an arbitrary vector norm are considered. It is proved that the sharp lower bound for the distances between successive extremums of xk(t) equals π/L where L is the Lipschitz constant. For non-constant periodic solutions, the lower bound for the periods is 2π/L. These estimates are achieved for norms that are invariant with respect to permutation of the indices.


Sign in / Sign up

Export Citation Format

Share Document