Related papers: A lower bound for the minimum deviation of the Che…
We establish an improved form of the classical logarithmic Sobolev inequality for the Gaussian measure restricted to probability densities which satisfy a Poincar\'e inequality. The result implies a lower bound on the deficit in terms of…
This paper deals with minimax rates of convergence for estimation of density functions on the real line. The densities are assumed to be location mixtures of normals, a global regularity requirement that creates subtle difficulties for the…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…
In this note, we establish a compact law of the iterated logarithm under the upper capacity for independent and identically distributed random variables in a sub-linear expectation space. For showing the result, a self-normalized law of the…
This short note presents a linear algebraic approach to proving dimension lower bounds for linear methods that solve $L^2$ function approximation problems. The basic argument has appeared in the literature before (e.g., Barron, 1993) for…
We obtain the decay bounds for Chebyshev series coefficients of functions with finite Vitali variation on the unit square. A generalization of the well known identity, which relates exact and approximated coefficients, obtained using the…
Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…
We give an improved lower bound for the $L_2$-discrepancy of finite point sets in the unit square.
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
In this work, we are dealing with some properties relating the zeros of a polynomial and its Mahler measure. We provide estimates on the number of real zeros of a polynomial, lower bounds on the distance between the zeros of a polynomial…
We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…
The classical P\'olya-Tchebotarev problem, commonly stated as a max-min logarithmic energy problem, asks for finding a compact of minimal capacity in the complex plane which connects a prescribed collection of fixed points. Variants of this…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
The series expansion of $x^m (-\log x)^l$ in terms of the shifted Chebyshev Polynomials $T_n^*(x)$ requires evaluation of the integral family $\int_0^1 x^m (-\log x)^l dx / \sqrt{x-x^2}$. We demonstrate that these can be reduced by partial…
We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…
We give the lower bound for the modulus of the radial derivatives and Jacobian of harmonic injective mappings from the unit ball onto convex domain in plane and space. As an application we show co-Lipschitz property of some classes of qch…
The minimal log discrepancy is an invariant of singularities that plays an important role in the birational classification of algebraic varieties. Shokurov conjectured that the minimal log discrepancy can always be bounded from above in…
Uniform polynomial approximation, also called minimax approximation or Chebyshev approximation, consists in searching polynomial approximation that minimizes the worst case error. Optimality conditions for the uniform approximation of…
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…
In this paper we obtain new results concerning maximum modulus of the polar derivative of a polynomial with restricted zeros. Our results generalize and refine upon the results of Aziz and Shah [An integral mean estimate for polynomial,…