Related papers: A Slightly Improved Bound for the KLS Constant
In this paper we give an upper bound of the third logarithmic coefficient for the class $\mathcal{S}$ of univalent functions in the unit disc.
This paper studies bilevel polynomial optimization problems. To solve them, we give a method based on polynomial optimization relaxations. Each relaxation is obtained from the Kurash-Kuhn-Tucker (KKT) conditions for the lower level…
Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…
We obtain several estimates for bilinear form with Kloosterman sums. Such results can be interpreted as a measure of cancellations amongst with parameters from short intervals. In particular, for certain ranges of parameters we improve some…
In this paper we rigorously compute the average multifractal spectrum of harmonic measure on the boundary of SLE clusters.
An old result by Shearer relates the Lov\'asz Local Lemma with the independent set polynomial on graphs, and consequently, as observed by Scott and Sokal, with the partition function of the hard core lattice gas on graphs. We use this…
Govindan and Klumpp [7] provided a characterization of perfect equilibria using Lexicographic Probability Systems (LPSs). Their characterization was essentially finite in that they showed that there exists a finite bound on the number of…
We prove a higher-rank analogue of a well-known result of W. M. Schmidt concerning almost everywhere pointwise discrepancy bounds for lattices in Euclidean space (see Theorem 1 [Trans. Amer. Math. Soc. 95 (1960), 516-529]). We also…
In this paper, we obtain the best possible value of the absolute constant $C$ such that for every isotropic convex body $K \subseteq \mathbb{R}^n$ the following inequality (which was proved by Klartag and reduces the hyperplane conjecture…
M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and…
We apply recent progress on Vinogradov's mean value theorem to improve bounds for the function $H(k)$ in the Waring-Goldbach problem. We obtain new results for all exponents $k \ge 7$, and in particular establish that for large $k$ one has…
In this paper, we consider two limiting cases ($\alpha\rightarrow n$ and $\alpha\rightarrow 0 $) of the recent affine HLS inequalities by Haddad and Ludwig. As $\alpha\rightarrow n$, the affine logarithmic HLS inequality is established,…
We derive bases of improved operators for all bilinear quark currents up to spin two (including the operators measuring the first moment of DIS Structure Functions), and compute their one-loop renormalization constants for arbitrary…
We establish a new spectral inequality for the quantified estimation of the $H^s$-norm, $s\ge 0$ of a finite linear combination of eigenfunctions in a domain in terms of its $H^s$-norm in a strictly open subset of the whole domain. The…
We improve the known upper bound for short exponential sums and increase the range on which a sharp upper bound is known.
We introduce and analyze a symmetric low-regularity scheme for the nonlinear Schr\"odinger (NLS) equation beyond classical Fourier-based techniques. We show fractional convergence of the scheme in $L^2$-norm, from first up to second order,…
The higher Euler-Kronecker constants of a number field $K$ are the coefficients in the Laurent series expansion of the logarithmic derivative of the Dedekind zeta function about $s=1$. These coefficients are mysterious and seem to contain a…
As is well known the Complex Langevin (CL) method sometimes fails to converge or converges to the wrong limit. We identified one reason for this long ago: insufficient decay of the probability density either near infinity or near poles of…
The popular LSPE($\lambda$) algorithm for policy evaluation is revisited to derive a concentration bound that gives high probability performance guarantees from some time on.
We improve the Cauchy radius of both scalar and matrix polynomials, which is an upper bound on the moduli of the zeros and eigenvalues, respectively, by using appropriate polynomial multipliers.