Multifold sumsets and fast decreasing of concentration functions
Let \(Q(X,l)\) denote the concentration function of a random variable \(X\), and let \(S_n=X_1,\dots,X_n\) where \(X_j\) are i.i.d. random variables. It is known that \(Q(S_n,l)\) tends to zero at least like \(1/\sqrt n\) when \(l\) is fixed and \(n\) grows. It is also known that in some cases the convergence is faster. The author formulates a conjecture on the connection between the rate of decay of \(Q(S_n,l)\) and the behaviour of the function \(Q(X_1,L)\) for large \(L\). A result is proved in this direction, which is based on some metrical properties of \(n\)-fold sumsets for large \(n\).
- Publication:4206165
- scientific article; zbMATH DE number 1042586
- Lower bounds on multiple distinct sum sets
- Subset sum in the absence of concentration
- On the density of sumsets
- A multiplicative inequality for concentration functions of $n$-fold convolutions
- An estimate on concentration functions of multiplicative functions and its applications
- Asymptotically tight bounds on subset sums
- Sum-products estimates with several sets and applications
- An Introduction to the Geometry of Numbers
- scientific article; zbMATH DE number 3505940 (Why is no real title available?)
- scientific article; zbMATH DE number 4126390 (Why is no real title available?)
- scientific article; zbMATH DE number 1266915 (Why is no real title available?)
- scientific article; zbMATH DE number 1315282 (Why is no real title available?)
- scientific article; zbMATH DE number 741240 (Why is no real title available?)
- scientific article; zbMATH DE number 3083529 (Why is no real title available?)
- On small values of semi-additive functions
- On the concentration function of a sum of independent random variables
- Estimates for the rapid decay of concentration functions of \(n\)-fold convolutions
- On the rate of decay of concentration functions of \(n\)-fold convolutions of probability distributions
- On the rate of decay of the concentration function of the sum of independent random variables
- Fast Monotone Summation over Disjoint Sets
This page was built for publication: Multifold sumsets and fast decreasing of concentration functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933628)