Related papers: Polynomial Approximation of Symmetric Functions

For set-valued functions (SVFs, multifunctions), mapping a compact interval $[a,b]$ into the space of compact non-empty subsets of ${\mathbb R}^d$, we study approximation based on the metric approach that includes metric linear…

For any subgroup $G$ of the symmetric group $\mathcal{S}_n$ on $n$ symbols, we present results for the uniform $\mathcal{C}^k$ approximation of $G$-invariant functions by $G$-invariant polynomials. For the case of totally symmetric…

In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

The question how to certify non-negativity of a polynomial function lies at the heart of Real Algebra and also has important applications to Optimization. In this article we investigate the question of non-negativity in the context of…

Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.

Motivated by a question in Schubert calculus, we study the interplay of quasisymmetric polynomials with the divided symmetrization operator, which was introduced by Postnikov in the context of volume polynomials of permutahedra. Divided…

Stanley associated with a graph G a symmetric function X_G which reduces to G's chromatic polynomial under a certain specialization of variables. He then proved various theorems generalizing results about the chromatic polynomial, as well…

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…

In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…

Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $\pi$ angle of the skew…

We investigate the complexity of integration and derivative for multivariate polynomials in the standard computation model. The integration is in the unit cube $[0,1]^d$ for a multivariate polynomial, which has format $f(x_1,\cdots,…

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

Let $f$ be a homogeneous polynomial with rational coefficients in $d$ variables. We prove several results concerning uniform simultaneous approximation to points on the graph of $f$, as well as on the hypersurface $\{f(x_1,\dots,x_d) =…

Four families of special functions, depending on n variables, are studied. We call them symmetric and antisymmetric multivariate sine and cosine functions. They are given as determinants or antideterminants of matrices, whose matrix…