相关论文: The best constant in the Khinchine inequality for …

In this paper we prove that the Haagerup inequality for non-homogeneous polynomials in free semicircular variables of degree $n$ is optimal with a constant of order $n^{3/2}$. We also show an operator valued Haagerup inequality which…

This paper is concerned with making Bayesian inference from data that are assumed to be drawn from a Bingham distribution. A barrier to the Bayesian approach is the parameter-dependent normalising constant of the Bingham distribution,…

We obtain the sharp factor of the two-sides estimates of the optimal constant in generalized Hardy's inequality with two general Borel measures on $\mathbb{R}$, which generalizes and unifies the known continuous and discrete cases.

We give a uniform estimate and an inequality for solutions of an equation with Dirichlet boundary condition.

In this article, we investigate observability-related properties of the Korteweg-de Vries equation with a discontinuous main coefficient, coupled by suitable interface conditions. The main result is a novel two-parameter Carleman estimate…

This paper studies the Hardy-type inequalities on the discrete intervals. The first result is the variational formulas of the optimal constants. Using these formulas, one may obtain an approximating procedure and the known basic estimates…

We establish deviation inequalities for the maxima of partial sums of a martingale differences sequence, and of a strictly stationary orthomartingale random field. These inequalities can be used to establish complete convergence of…

We constraint on computer the best linear unbiased generalized statistics of random field for the best linear unbiased generalized statistics of an unknown constant mean of random field and derive the numerical generalized least-squares…

We give a proof of the Lieb-Thirring inequality in the critical case $d=1$, $\gamma= 1/2$, which yields the best possible constant.

We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal. In addition…

Quantum estimation theory provides optimal observations for various estimation problems for unknown parameters in the state of the system under investigation. However, the theory has been developed under the assumption that every observable…

We prove Khinchin-type inequalities with sharp constants for type L random variables and all even moments. Our main tool is Hadamard's factorisation theorem from complex analysis, combined with Newton's inequalities for elementary symmetric…

We consider non-autonomous calculus of variations problems with a state constraint represented by a given closed set. We prove that if the interior of the Clarke tangent cone of the state constraint set is non-empty (this is the constraint…

Chang's lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the…

We consider the uncertainty bound on the sum of variances of two incompatible observables in order to derive a corresponding steering inequality. Our steering criterion when applied to discrete variables yields the optimum steering range…

Let $X$ be a random variable and define its concentration function by $$\mathcal{Q}_{h}(X)=\sup_{x\in \mathbb{R}}\mathbb{P}(X\in (x,x+h]).$$ For a sum $S_n=X_1+\cdots+X_n$ of independent real-valued random variables the Kolmogorov-Rogozin…

We give a non-asymptotic bound on the spectral norm of a $d\times d$ matrix $X$ with centered jointly Gaussian entries in terms of the covariance matrix of the entries. In some cases, this estimate is sharp and removes the $\sqrt{\log d}$…

In this paper, we will prove a very general result of stability for perturbations of linear integrable Hamiltonian systems, and we will construct an example of instability showing that both our result and our example are optimal. Moreover,…

We consider the problem of estimating the support size of a discrete distribution whose minimum non-zero mass is at least $ \frac{1}{k}$. Under the independent sampling model, we show that the sample complexity, i.e., the minimal sample…

For a given $x$ we consider the minimum of $\sum_{n\le x} \chi(n)/n$ as $\chi$ ranges over all quadratic Dirichlet characters. For all large $x$, this minimum is negative and we give upper and lower bounds for it.