相关论文: A simple proof of Schmidt-Summerer's inequality

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

We run an iteration argument due to Pramanik and Seeger, to provide a proof of sharp decoupling inequalities for conical surfaces and for $k$-cones. These are extensions of results \L aba and Pramanik to sharp exponents.

Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…

We will discuss some results of the paper "Asymptotic estimates on the Von Neumann Inequality for homogeneous polynomials", of Galicer D., Muro S. and Sevilla-Peris P. Also, we will see how to extend some of these results using the same…

In this paper, we first present simple proofs of Choi's results [4], then we give a short alternative proof for Fiedler and Markham's inequality [6]. We also obtain additional matrix inequalities related to partial determinants.

We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.

We improve using elementary means an explicit bound on the divisor function due to Friedlander and Iwaniec. Consequently we modestly improve a result regarding a sieving inequality for Gaussian sequences.

We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…

We give a simple proof of the exponential de Finetti theorem due to Renner. Like Renner's proof, ours combines the post-selection de Finetti theorem, the Gentle Measurement lemma, and the Chernoff bound, but avoids virtually all…

Let $\Theta$ be a point in ${\bf R}^n$. We split the classical Khintchine's Transference Principle into $n-1$ intermediate estimates which connect exponents $\omega_d(\Theta)$ measuring the sharpness of the approximation to $\Theta$ by…

First we prove a modified version of the famous Lemma on the mean square estimate for exponential sums, by plugging the Cesaro weights in the right hand side of Gallagher's inequality. Then we apply it, in order to establish a mean value…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

We study properties of Diophantine exponents of lattices and so-called related "weak" uniform approximations introduced in recent papers by Oleg German, in the simplest two-dimensional case. In contrast to the multidimensional case, in the…

We prove an inequality for polynomials applied in a symmetric way to non-commuting operators.

Many results related to quantitative problems in the metric theory of Diophantine approximation are asymptotic, such as the number of rational solutions to certain inequalities grows with the same rate almost everywhere modulo an asymptotic…

We prove Burkholder inequality using Bregman divergence.

Let $E\subset [0,1)^{d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|)^{-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices…

Let $c > 1$ and $0 < \gamma < 1$ be real, with $c \notin \mathbb N$. We study the solubility of the Diophantine inequality \[ \left| p_1^c + p_2^c + \dots + p_s^c - N \right| < \varepsilon \] in Piatetski-Shapiro primes $p_1, p_2, \dots,…

Using as the working hypothesis of an evaluation of the difference between primes $p_{n+1} - p_n = O(\sqrt{p_n})$ we represent in detail the proofs of Legendre's and Oppermann's conjectures.

We provide a short proof for the Figiel, Lindenstrauss and Milman inequality regarding the number of vertices and faces of certain polytope, with an explicit bound on the universal constant involved. The proof is completely elementary and…