Related papers: The Bramble-Hilbert Lemma
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.
The purpose of this note is to compare various approximation methods as applied to the inverse of the Bessel function of the first kind, in a given domain of the complex plane.
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
An observation on Hall-Littlewood polynomials.
An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard…
This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…
In this paper we discuss a framework for the polynomial approximation to the solution of initial value problems for differential equations. The framework, initially devised for the approximation of ordinary differential equations, is…
In the first part of this expository paper, we present and discuss the interplay of Dirichlet polynomials in some classical problems of number theory, notably the Lindel\"of Hypothesis. We review some typical properties of their means and…
It is described how the Hermite-Pad\'e polynomials corresponding to an algebraic approximant for a power series may be used to predict coefficients of the power series that have not been used to compute the Hermite-Pad\'e polynomials. A…
The Hermite polynomials are ubiquitous but can be difficult to work with due to their unwieldy definition in terms of derivatives. To remedy this, we showcase an underappreciated Gaussian integral formula for the Hermite polynomials, which…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…
This document is a companion for the Maple program \textbf{Summing a polynomial function over integral points of a polygon}. It contains two parts. First, we see what this programs does. In the second part, we briefly recall the…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
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…
We sample some Poincare-Birkhoff-Witt theorems appearing in mathematics. Along the way, we compare modern techniques used to establish such results, for example, the Composition-Diamond Lemma, Groebner basis theory, and the homological…
In this paper the authors show how to use Riemann-Hilbert techniques to prove various results, some old, some new, in the theory of Toeplitz operators and orthogonal polynomials on the unit circle (OPUC's). There are four main results: the…