Related papers: Multivariate polynomial approximation in the hyper…
Given the equations of the first and the second order surfaces in multidimensional space, our goal is to construct a univariate polynomial one of the zeros of which coincides with the square of the distance between these surfaces. To…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
We present a formula describing the asymptotics of a class of multivariate orthogonal polynomials with hyperoctahedral symmetry as the degree tends to infinity. The polynomials under consideration are characterized by a factorized weight…
The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
We consider the non-parametric maximum likelihood estimation in the class of Polya frequency functions of order two, viz. the densities with a concave logarithm. This is a subclass of unimodal densities and fairly rich in general. The NPMLE…
Given a ternary homogeneous polynomial, the fixed points of the map from $\mathbb{P}^2$ to itself defined by its gradient are called its eigenpoints. We focus on cubic polynomials, and analyze configurations of eigenpoints that admit one or…
A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
We study approximation properties of weighted $L^2$-orthogonal projectors onto spaces of polynomials of bounded degree in the Euclidean unit ball, where the weight is of the generalized Gegenbauer form $x \mapsto (1-\|x\|^2)^\alpha$,…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…
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…
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…
If $R=k[x_1,\ldots,x_n]/I$ is a graded artinian algebra, then the length of $k[x_1,\ldots,x_n]/I^s$ becomes a polynomial in $s$ of degree $n$ for large $s$. If we write this polynomial as $\sum_{i=0}^n(-1)^ie_i{s+n-i-1\choose n-i}$, then…