Related papers: Lower Bounds for Weighted Chebyshev and Orthogonal…
The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…
We consider the semi-classical generalized Freud weight function \[w_{\lambda}(x;t) = |x|^{2\lambda+1}\exp(-x^4 +tx^2),\qquad x\in\mathbb{R},\] with $ \lambda>-1$ and $t\in\mathbb{R}$ parameters. We analyze the asymptotic behavior of the…
This is a survey article on an old topic in classical analysis. We present some new developments in asymptotics in the last fifty years. We start with the classical method of Darboux and its generalizations, including an uniformity…
We prove asymptotic lower bounds on the variance of the number of vertices and missed area of random disc-polygons in convex discs whose boundary is $C_+^2$ smooth. The established lower bounds are of the same order as the upper bounds…
In the case when the weight and its inverse belong to BMO(T), we prove the asymptotics of the monic orthogonal polynomials in L^p, 2<p<p_0. Immediate applications include the estimates on the uniform norm and asymptotics for the polynomial…
Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…
This paper is concerned with estimating the intersection point of two densities, given a sample of both of the densities. This problem arises in classification theory. The main results provide lower bounds for the probability of the…
Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…
A classic theorem of Kazhdan and Margulis states that for any semisimple Lie group without compact factors, there is a positive lower bound on the covolume of lattices. H. C. Wang's subsequent quantitative analysis showed that the…
The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…
Let $D$ be a domain obtained by removing, out of the unit disk $\{z:|z|<1\}$, finitely many mutually disjoint closed disks, and for each integer $n\geq 0$, let $P_n(z)=z^n+\cdots$ be the monic $n$th-degree polynomial satisfying the planar…
We revisit the standard ``telescoping sum'' argument ubiquitous in the final steps of analyzing evaluation complexity of algorithms for smooth nonconvex optimization, and obtain a refined formulation of the resulting bound as a function of…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…
We introduce and study the unconstrained polarization (or Chebyshev) problem which requires to find an $N$-point configuration that maximizes the minimum value of its potential over a set $A$ in $p$-dimensional Euclidean space. This problem…
Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic Gilbert-Varshamov bound is a very sharp…
Weighting methods are widely used to adjust for covariates in observational studies, sample surveys, and regression settings. In this paper, we study a class of recently proposed weighting methods which find the weights of minimum…
We use a non-linear characterization of orthonormal polynomials due to Saff in order to show that the behavior of orthonormal polynomials is determined only by its leading coefficient and its normalization. Several applications of this…
In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…
This is an expanded version of the talk given at the conference ``Constructive Functions Tech-04''. We survey some recent results on canonical representation and asymptotic behavior of polynomials orthogonal on the unit circle with respect…