Related papers: On a bound of Hoeffding in the complex case

The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…

Let $A$ be a compact $d$-dimensional $C^2$ Riemannian manifold with boundary, embedded in ${\bf R}^m$ where $m \geq d \geq 2$, and let $B$ be a nice subset of $A$ (possibly $B=A$). Let $X_1,X_2, \ldots $ be independent random uniform points…

A family of random variables $\mathbf{X}(s)$, depending on a real parameter $s>-\frac{1}{2}$, appears in the asymptotics of the joint moments of characteristic polynomials of random unitary matrices and their derivatives, in the ergodic…

Murthy and Sethi (Sankhya Ser B \textbf{27}, 201--210 (1965)) gave a sharp upper bound on the variance of a real random variable in terms of the range of values of that variable. We generalise this bound to the complex case and, more…

We shall establish two-side explicit inequalities, which are asymptotically sharp up to a constant factor, on the maximum value of $|H_k(x)| e^{-x^2/2},$ on the real axis, where $H_k$ are the Hermite polynomials.

A sequence of random variables is called \textit{exchangeable} if its joint distribution is invariant under permutations of indices. The original formulation of de Finetti's theorem roughly says that any exchangeable sequence of…

We consider the hard-edge scaling of the Mittag-Leffler ensemble confined to a fixed disk inside the droplet. Our primary emphasis is on fluctuations of rotationally-invariant additive statistics that depend on the radius and thus give rise…

In a paper from 1995, Wormald gave general criteria for certain parameters in a family of discrete random processes to converge to the solution of a system of differential equations. Based on this method, we show that if some further…

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

In 1938 E. T. Bell introduced "The Iterated Exponential Integers". He proved that these numbers may be expressed by polynomials with rational coefficients. However, Bell gave no formulas for any of the coefficients except the trivial one,…

It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on…

We investigate when the exponential sum $S_f(x,\alpha) := \sum_{n\le x}f(n)\mathrm{e}(n\alpha)$ is bounded, for a multiplicative function $f$ and $\alpha\in\mathbb{R}$. We show that under natural assumptions, $S_f(x,\alpha)$ is bounded only…

Let R denote the reals, and let h: R^n --> R be a continuous, piecewise-polynomial function. The Pierce-Birkhoff conjecture (1956) is that any such h is representable in the form sup_i inf_j f_{ij}, for some finite collection of polynomials…

Suppose $f : [0,1]^2 \rightarrow \mathbb{R}$ is a $(c,\alpha)$-mixed H\"older function that we sample at $l$ points $X_1,\ldots,X_l$ chosen uniformly at random from the unit square. Let the location of these points and the function values…

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

A result of Chebyshev (1864) and Hoeffding1956}, on bounding an expectation of a given function with respect to a Bernoulli convolution (also called Poisson binomial law, or law of the number of successes in independent trials) with any…

In 1977 Pohst conjectured a certain inequality for $n$ variables and give a computer-assisted proof for $n\leq 10$. We give a proof for all $n$ using a combinatorial argument. This inequality yields a better bound for the regulator in terms…

Let $D$ be a bounded domain in a complex Banach space. According to the Earle-Hamilton fixed point theorem, if a holomorphic mapping $F : D \mapsto D$ maps $D$ strictly into itself, then it has a unique fixed point and its iterates converge…

In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usually called Boolean constraint satisfaction problems) and…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…