Related papers: Evaluating Polynomials Over the Unit Disk and the …
In this paper we give an asymptotic of the coefficients of the orthogonal polynomials on the unit circle, with respect of a weight of type $\displaystyle{ f : \theta \mapsto \prod_{1\le j \le M} \vert 1 - e^{i(\theta_{j}-\theta)}\vert…
Fourier transform of multivariate orthogonal polynomials on the unit ball are obtained. By using Parseval's identity, a new family of multivariate orthogonal functions are introduced. The results are expressed in terms of the continuous…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
We present an orthogonal basis for functions over a slice of the Boolean hypercube. Our basis is also an orthogonal basis of eigenvectors for the Johnson and Kneser graphs. As an application of our basis, we streamline Wimmer's proof of…
We announce numerous new results in the theory of orthogonal polynomials on the unit circle.
In the family of unit balls with constant volume we look at the ones whose algebraic representation has some extremal property. We consider the family of nonnegative homogeneous polynomials of even degree $d$ whose sublevel set $\G=\{\x:…
Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial $f$ in $d$ freely noncommuting arguments, find a free polynomial $p_n$, of…
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…
The subject of this paper is the design of efficient and stable spectral methods for time-dependent partial differential equations in unit balls. We commence by sketching the desired features of a spectral method, which is defined by a…
The aim of this paper is to unveil an unexpected relationship between the normal form of a polynomial with respect to a polynomial ideal and the more geometric concept of orthogonality. We present a new way to calculate the normal form of a…
In this paper we obtain new results about the orthogonality measure of orthogonal polynomials on the unit circle, through the study of unitary truncations of the corresponding unitary multiplication operator, and the use of the…
We present an expository introduction to orthogonal polynomials on the unit circle.
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\}$…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…
We establish simultaneous approximation properties of weighted first-order Sobolev orthogonal projectors onto spaces of polynomials of bounded total degree in the Euclidean unit ball. The simultaneity is in the sense that we provide bounds…
We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere. We identify a class of…
We introduce a class of orthogonal polynomials in two variables which generalizes the disc polynomials and the 2-$D$ Hermite polynomials. We identify certain interesting members of this class including a one variable generalization of the…
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse…
Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…