Loading [MathJax]/extensions/MathZoom.js
- Subjects
- 52-XX Convex and discrete geometry
We discuss a conjecture about comparability of weak and strong moments of log-concave random vectors and show the conjectured inequality for unconditional vectors in normed spaces with a bounded cotype constant.
The classical Hardy-Littlewood maximal operator is bounded not only on the classical Lebesgue spaces (in the case ), but (in the case when is log-Hölder continuous and ) on the variable Lebesgue spaces , too. Furthermore, the classical Hardy-Littlewood maximal operator is of weak-type . In the present note we generalize Besicovitch’s covering theorem for the so-called -rectangles. We introduce a general maximal operator and with the help of generalized -functions, the strong- and weak-type...
Lower estimates for weak distances between finite-dimensional Banach spaces of the same dimension are investigated. It is proved that the weak distance between a random pair of n-dimensional quotients of is greater than or equal to c√(n/log³n).
A lattice in Euclidean d-space is called well-rounded if it contains d linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The task of enumerating well-rounded sublattices of a given lattice is of interest already in dimension 2, and has recently been treated by several authors. In this paper, we analyse the question more closely in the spirit of earlier work on similar sublattices and coincidence...
We prove sharp estimates on the expected number of windings of a simple random walk on the square or triangular lattice. This gives new lower bounds on the averaged Dehn function, which measures the expected area needed to fill a random curve with a disc.
Currently displaying 1 –
16 of
16