Related papers: The Gibbs phenomenon for the Krawtchouk polynomial…

The spectral measure for the two families of orthogonal polynomial systems related to periodic chains with N-particle elementary unit and nearest neighbour harmonic interaction is computed using two different methods. The interest is in the…

All the available results on the approximation of the k-spacings process to Gaussian processes have only used one approach, that is the Shorack and Pyke's one. Here, it is shown that this approach cannot yield a rate better than $% \left(…

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

This paper builds on the notion of the so-called orthogonal derivative, where an n-th order derivative is approximated by an integral involving an orthogonal polynomial of degree n. This notion was reviewed in great detail in a paper in J.…

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small, highly structured, or very sparse. We have devised and…

Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

The $\epsilon$-approximate degree $deg_\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\epsilon$. The approximate degree of $f$ is at least $k$ iff there…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…

For the Hahn and Krawtchouk polynomials orthogonal on the set $\{0, \ldots,N\}$ new identities for the sum of squares are derived which generalize the trigonometric identity for the Chebyshev polynomials of the first and second kind. These…

In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…

Let $\tau_k$ be the $k$-fold divisor function. By constructing an approximant of $\tau_k$, denoted as $\tau_k^*$, which is a normalized truncation of the $k$-fold divisor function, we prove that when $\exp\left(C\log^{1/2}X(\log\log…

Let $K$ be the closure of a bounded region in the complex plane with simply connected complement whose boundary is a piecewise analytic curve with at least one outward cusp. The asymptotics of zeros of Faber polynomials for $K$ are not…

In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.

The speed of convergence of the R-linear GMRES is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is…

The Keating-Snaith central limit theorem proves that $\Lambda_N(A)=\log\det(I-A)$, for randomly drawn $A\in \operatorname{U}(N)$, suitably normalised, tends to a complex Gaussian random variable in the large $N$ limit. The deviations of the…

We review some probabilistic properties of the sum-of-digits function of random integers. New asymptotic approximations to the total variation distance and its refinements are also derived. Four different approaches are used: a classical…

We call Krawtchouk-Griffiths systems, KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…