We consider the space ${}^{ℳ}$ of ultradifferentiable functions with compact supports and the space of polynomials on ${}^{ℳ}$. A description of the space ${(}^{ℳ})$ of polynomial ultradistributions as a locally convex direct sum is given.

Let f: ℝⁿ → ℝ be a polynomial function of degree d with f(0) = 0 and ∇f(0) = 0. Łojasiewicz’s gradient inequality states that there exist C > 0 and ϱ ∈ (0,1) such that ${\left|\nabla f\right|\ge C\left|f\right|}^{\varrho }$ in a neighbourhood of the origin. We prove that the smallest such exponent ϱ is not greater than $1-R{(n,d)}^{-1}$ with $R(n,d)=d{(3d-3)}^{n-1}$.

The paper deals with the approximation by polynomials with integer coefficients in $L_p(0,1)$, 1 ≤ p ≤ ∞. Let $P_{n,r}$ be the space of polynomials of degree ≤ n which are divisible by the polynomial $x^r{(1-x)}^r$, r ≥ 0, and let $P_{n,r}^{\mathbb{Z}}\subset P_{n,r}$ be the set of polynomials with integer coefficients. Let $\mu (P_{n,r}^{\mathbb{Z}};L_p)$ be the maximal distance of elements of $P_{n,r}$ from $P_{n,r}^{\mathbb{Z}}$ in $L_p(0,1)$. We give rather precise quantitative estimates of $\mu (P_{n,r}^{\mathbb{Z}};L₂)$ for n ≳ 6r. Then we obtain similar, somewhat less precise, estimates of $\mu (P_{n,r}^{\mathbb{Z}};L_p)$ for p ≠ 2. It follows that $\mu (P_{n,r}^{\mathbb{Z}};L_p)\asymp n^{-2r-2/p}$ as n → ∞. The results...

Let P be a unimodular polynomial of degree d-1. Then the height H(P²) of its square is at least √(d/2) and the product L(P²)H(P²), where L denotes the length of a polynomial, is at least d². We show that for any ε > 0 and any d ≥ d(ε) there exists a polynomial P with ±1 coefficients of degree d-1 such that H(P²) < (2+ε)√(dlogd) and L(P²)H(P²)< (16/3+ε)d²log d. A similar result is obtained for the series with ±1 coefficients. Let $A_m$ be the mth coefficient of the square f(x)² of...

Let ${𝕋}_n$ be the space of all trigonometric polynomials of degree not greater than $n$ with complex coefficients. Arestov extended the result of Bernstein and others and proved that $\parallel (1/n)T_n^{\text{'}}{\parallel }_p\le {\parallel T_n\parallel }_p$ for $0\le p\le \infty$ and $T_n\in {𝕋}_n$. We derive the multivariate version of the result of Golitschek and Lorentz $${∥{\left|T_{n}cos\alpha +\frac{1}{n}\nabla T_{n}sin\alpha \right|}_{l_{\infty }^{\left(m\right)}}∥}_p\le {\parallel T_n\parallel }_p,0\le p\le \infty$$ for all trigonometric polynomials (with complex coeffcients) in $m$ variables of degree at most $n$.

For n ∈ ℕ, L > 0, and p ≥ 1 let ${\kappa }_p(n,L)$ be the largest possible value of k for which there is a polynomial P ≠ 0 of the form $P\left(x\right)={\sum }_{j=0}^n{a}_j{x}^j$, $|a_0\left|\ge L\right({\sum }_{j=1}^n|a_j{|}^p$1/p$,$aj ∈ ℂ$,$such that ${(x-1)}^k$ divides P(x). For n ∈ ℕ and L > 0 let ${\kappa }_{\infty }(n,L)$ be the largest possible value of k for which there is a polynomial P ≠ 0 of the form $P\left(x\right)={\sum }_{j=0}^n{a}_j{x}^j$, $|a_0|\ge Lma{x}_{1\le j\le n}|a_j|$, $a_j\in ℂ$, such that ${(x-1)}^k$ divides P(x). We prove that there are absolute constants c₁ > 0 and c₂ > 0 such that $c_1\surd (n/L)-1\le {\kappa }_{\infty }(n,L)\le c_2\surd (n/L)$ for every L ≥ 1. This complements an earlier result of the authors valid for every n ∈ ℕ and L ∈...

Assuming that $C_{X,Y}$ is the copula function of $X$ and $Y$ with marginal distribution functions $F_X\left(x\right)$ and $F_Y\left(y\right)$, in this work we study the selection distribution $Z\stackrel{\mathrm{d}}{=}\left(X\right|Y\in T)$. We present some special cases of our proposed distribution, among them, skew-normal distribution as well as normal distribution. Some properties such as moments and moment generating function are investigated. Also, some numerical analysis is presented for illustration.

Let $P$ be a polynomial with integral coefficients. Shapiro showed that if the values of $P$ at infinitely many blocks of consecutive integers are of the form $Q\left(m\right)$, where $Q$ is a polynomial with integral coefficients, then $P\left(x\right)=Q\left(R\right(x\left)\right)$ for some polynomial $R$. In this paper, we show that if the values of $P$ at finitely many blocks of consecutive integers, each greater than a provided bound, are of the form $m^q$ where $q$ is an integer greater than 1, then $P\left(x\right)={\left(R\left(x\right)\right)}^q$ for some polynomial $R\left(x\right)$.

Let $P_k$ be any sequence of classical orthogonal polynomials. Further, let f be a function satisfying a linear differential equation with polynomial coefficients. We give an algorithm to construct, in a compact form, a recurrence relation satisfied by the coefficients $a_k$ in $f={\sum }_k{a}_k{P}_k$. A systematic use of the basic properties (including some nonstandard ones) of the polynomials $P_k$ results in obtaining a low order of the recurrence.

We consider the polynomial $f_k\left(z\right)=z^k-z^{k-1}-\cdots -z-1$ for $k\ge 2$ which arises as the characteristic polynomial of the $k$-generalized Fibonacci sequence. In this short paper, we give estimates for the absolute values of the roots of $f_k\left(z\right)$ which lie inside the unit disk.

For a random vector $(X,Y)$ characterized by a copula $C_{X,Y}$ we study its perturbation $C_{X+Z,Y}$ characterizing the random vector $(X+Z,Y)$ affected by a noise $Z$ independent of both $X$ and $Y$. Several examples are added, including a new comprehensive parametric copula family ${\left({𝒞}_k\right)}_{k\in [-\infty ,\infty ]}$.

Let D and ∂D denote the open unit disk and the unit circle of the complex plane, respectively. We denote by ₙ (resp. ${ₙ}^c$) the set of all polynomials of degree at most n with real (resp. complex) coefficients. We define the truncation operators Sₙ for polynomials $Pₙ\in {ₙ}^c$ of the form $Pₙ\left(z\right):={\sum }_{j=0}^n{a}_j{z}_j$, $a_j\in C$, by $Sₙ\left(Pₙ\right)\left(z\right):={\sum }_{j=0}^{n}a{̃}_j{z}_j$, $a{̃}_j:=a_j\left|a_j\right|min|a_j|,1$ (here 0/0 is interpreted as 1). We define the norms of the truncation operators by $\parallel Sₙ{\parallel }_{\infty ,\partial D}^{real}:=su{p}_{Pₙ\in ₙ}(ma{x}_{z\in \partial D}\left|Sₙ\left(Pₙ\right)\left(z\right)\right|)/(ma{x}_{z\in \partial D}\left|Pₙ\left(z\right)\right|)$, $\parallel Sₙ{\parallel }_{\infty ,\partial D}^{comp}:=su{p}_{Pₙ\in {ₙ}^c}(ma{x}_{z\in \partial D}\left|Sₙ\left(Pₙ\right)\left(z\right)\right|)/(ma{x}_{z\in \partial D}\left|Pₙ\left(z\right)\right|$. Our main theorem establishes the right order of magnitude of the above norms: there is an absolute constant c₁...

For n ∈ ℕ, L > 0, and p ≥ 1 let ${\kappa }_p(n,L)$ be the largest possible value of k for which there is a polynomial P ≢ 0 of the form $P\left(x\right)={\sum }_{j=0}^n{a}_j{x}^j$, $|a_0\left|\ge L\right({\sum }_{j=1}^n|a_j{{|}^p)}^{1/p}$, $a_j\in ℂ$, such that ${(x-1)}^k$ divides P(x). For n ∈ ℕ, L > 0, and q ≥ 1 let ${\mu }_q(n,L)$ be the smallest value of k for which there is a polynomial Q of degree k with complex coefficients such that $\left|Q\left(0\right)\right|>1/L({\sum }_{j=1}^n{\left|Q\left(j\right)\right|}^q{)}^{1/q}$. We find the size of ${\kappa }_p(n,L)$ and ${\mu }_q(n,L)$ for all n ∈ ℕ, L > 0, and 1 ≤ p,q ≤ ∞. The result about ${\mu }_{\infty }(n,L)$ is due to Coppersmith and Rivlin, but our proof is completely different and much shorter even...

The coefficients of the greatest common divisor of two polynomials $f$ and $g$ (GCD$(f,g)$) can be obtained from the Sylvester subresultant matrix $S_j(f,g)$ transformed to lower triangular form, where $1\le j\le d$ and $d=$ deg(GCD$(f,g)$) needs to be computed. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformations of $S_j(f,g)$ for an arbitrary allowable $j$ are in details described and an algorithm for the calculation of the GCD$(f,g)$ is formulated. If inexact polynomials are given, then an approximate...

We study the following nonlinear method of approximation by trigonometric polynomials. For a periodic function f we take as an approximant a trigonometric polynomial of the form $Gₘ\left(f\right):={\sum }_{k\in \Lambda }f̂\left(k\right)e^{i(k,x)}$, where $\Lambda \subset {\mathbb{Z}}^d$ is a set of cardinality m containing the indices of the m largest (in absolute value) Fourier coefficients f̂(k) of the function f. Note that Gₘ(f) gives the best m-term approximant in the L₂-norm, and therefore, for each f ∈ L₂, ||f-Gₘ(f)||₂ → 0 as m → ∞. It is known from previous results that in...

Let $\parallel ·\parallel$ be the uniform norm in the unit disk. We study the quantities $M_n\left(\alpha \right):=inf(\parallel zP\left(z\right)+\alpha \parallel -\alpha )$ where the infimum is taken over all polynomials $P$ of degree $n-1$ with $\parallel P\left(z\right)\parallel =1$ and $\alpha >0$. In a recent paper by Fournier, Letac and Ruscheweyh (Math. Nachrichten 283 (2010), 193-199) it was shown that ${inf}_{\alpha >0}{M}_n\left(\alpha \right)=1/n$. We find the exact values of $M_n\left(\alpha \right)$ and determine corresponding extremal polynomials. The method applied uses known cases of maximal ranges of polynomials.