Related papers: Between Chebyshev and Cantelli
In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the…
In this note we provide a new, algebraic proof of the excessive Laurent phenomenon for mutations of potentials (in the sense of [Galkin S., Usnich A., Preprint IPMU 10-0100, 2010]) by introducing to this theory the analogue of the upper…
A Chebyshev-type quadrature for a given weight function is a quadrature formula with equal weights. In this work we show that a method presented by Kane may be used to produce tight bounds for the minimal number of nodes required in…
In this work, considering a general subclass of bi-univalent functions and using the Chebyshev polynomials, we obtain coefficient expansions for functions in this class.
We find a family of convergent schemes of nodes for non-complete interpolatory quadrature rules.
In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration…
The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…
By a profound result of Heinrich, Novak, Wasilkowski, and Wo{\'z}niakowski the inverse of the star-discrepancy $n^*(s,\ve)$ satisfies the upper bound $n^*(s,\ve) \leq c_{\mathrm{abs}} s \ve^{-2}$. This is equivalent to the fact that for any…
This is a survey paper that discusses the original bounds of the seminal papers by Chernoff and Hoeffding. Moreover, it includes a variety of derivative bounds in a variety of forms. Complete proofs are provided as needed. The intent is to…
The discrete cosine transforms of types V--VIII are generalized to the antisymmetric and symmetric multivariate discrete cosine transforms. Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to…
We discuss five ways of proving Chernoff's bound and show how they lead to different extensions of the basic bound.
A Chebyshev knot is a knot which admits a parametrization of the form $ x(t)=T_a(t); \ y(t)=T_b(t) ; \ z(t)= T_c(t + \phi), $ where $a,b,c$ are pairwise coprime, $T_n(t)$ is the Chebyshev polynomial of degree $n,$ and $\phi \in \RR .$…
In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…
We evaluate the values of the Lebesgue constants in polynomial interpolation for three types of Cantor sets. In all cases, the sequences of Lebesgue constants are not bounded. This disproves the statement by Mergelyan.
We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…
We consider a sequence of composite Bernstein operators and the quadrature formulae associated with them. Upper bounds for the approximation error of continuous functions and for the approximation of integrals of continuous functions are…
We compute the limits of a class of periodic continued radicals and we establish a connection between them and the fixed points of the Chebycheff polynomials.
Prime counting functions are believed to exhibit, in various contexts, discrepancies beyond what famous equidistribution results predict; this phenomenon is known as Chebyshev's bias. Rubinstein and Sarnak have developed a framework which…
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.
We give a complete characterization of limiting interpolation spa\-ces for the real method of interpolation using extrapolation theory. For this purpose the usual tools (e.g., Boyd indices or the boundedness of Hardy type operators) are not…