English
Related papers

Related papers: On an operator preserving inequalities between pol…

200 papers

In this paper, we investigate an upper bound of the polar derivative of a polynomial of degree $n$ $$p(z)=(z-z_m)^{t_m} (z-z_{m-1})^{t_{m-1}}\cdots (z-z_0)^{t_0}(a_0+\sum\limits_{\nu=\mu} ^{n-(t_m+\cdots+t_0)} a_{\nu}z^\nu)$$ where zeros…

Complex Variables · Mathematics 2018-04-30 Nuttapong Arunrat , Keaitsuda Maneeruk Nakprasit

We identify the dimension of the centralizer of the symmetric group $\mathfrak{S}_d$ in the partition algebra $\mathcal{A}_d(\delta)$ and in the Brauer algebra $\mathcal{B}_d(\delta)$ with the number of multidigraphs with $d$ arrows and the…

Rings and Algebras · Mathematics 2021-03-08 Myungho Kim , Doyun Koo

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…

Classical Analysis and ODEs · Mathematics 2021-09-16 Stefan Steinerberger

We give the sufficient condition on coefficients $a_k$ of an algebraic polynomial $P(z)=\sum_{k=0}^{n}a_kz^k$, $a_n\not=0,$ for the pointwise Bernstein inequality $|P'(z)|\le n|P(z)|$ to be true for all $z\in\overline{\mathbb…

Complex Variables · Mathematics 2021-04-06 Adrian Savchuk

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Number Theory · Mathematics 2018-10-16 Oleksiy Klurman , Marc Munsch

A new measure called min-max elementwise backward error is introduced for approximate roots of scalar polynomials $p(z)$. Compared with the elementwise relative backward error, this new measure allows for larger relative perturbations on…

Numerical Analysis · Mathematics 2020-01-16 Francoise Tisseur , Marc Van Barel

In this paper, we investigate the uniqueness problem of difference polynomials $f^{n}(z)P(f(z))L_c(f)$ and $g^{n}(z)P(g(z))L_c(g)$, where $L_c(f)=f(z+c)+c_0f(z)$, $P(z)$ is a polynomial with constant coefficients of degree $m$ sharing a…

Complex Variables · Mathematics 2021-03-19 Goutam Haldar

Given a linear ordinary differential operator T with polynomial coefficients, we study the class of closed subsets of the complex plane such that T sends any polynomial (resp. any polynomial of degree exceeding a given positive integer)…

Classical Analysis and ODEs · Mathematics 2024-04-23 Per Alexandersson , Petter Brändén , Boris Shapiro

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

Classical Analysis and ODEs · Mathematics 2019-09-24 Tamás Erdélyi

For a finite set of natural numbers $D$ consider a complex polynomial of the form $f(z) = \sum_{d \in D} c_d z^d$. Let $\rho_+(f)$ and $\rho_-(f)$ be the fractions of the unit circle that $f$ sends to the right($\operatorname{Re} f(z) > 0$)…

Classical Analysis and ODEs · Mathematics 2024-08-22 Abdulamin Ismailov

In this paper we investigate the generalization of the Bessenrodt--Ono inequality by following Gian-Carlo Rota's advice in studying problems in combinatorics and number theory in terms of roots of polynomials. We consider the number of…

Combinatorics · Mathematics 2019-10-24 Bernhard Heim , Markus Neuhauser , Robert Tröger

The paper aims to provide a full characterization of all operators $T\colon \mathscr{P}(\mathbb{C}) \to \mathscr{P}(\mathbb{C})$ acting on the space of all complex polynomials that satisfy the Leibniz rule \[ T(f\cdot g)= T(f)\cdot g+f\cdot…

Classical Analysis and ODEs · Mathematics 2025-01-23 Włodzimierz Fechner , Eszter Gselmann

For a real polynomial $p = \sum_{i=0}^{n} c_ix^i$ with no negative coefficients and $n\geq 6$, let $\beta (p) = \inf_{i=1}^{n-1} c_i^2/c_{i+1}c_{i-1}$ (so $\beta (p) \geq 1$ entails that $p$ is log concave). If $\beta(p) > 1.45...$, then…

Classical Analysis and ODEs · Mathematics 2010-10-01 David Handelman

We show that any differential operator of the form $L(y)=\sum_{k=0}^{k=N} a_{k}(x) y^{(k)}$, where $a_k$ is a real polynomial of degree $\leq k$, has all real eigenvalues in the space of polynomials of degree at most n, for all n. The…

Classical Analysis and ODEs · Mathematics 2010-02-28 H. Azad , M. T. Mustafa

Let $ P(z) $ be a polynomial of degree $ n $ having all zeros in $|z|\leq k$ where $k\leq 1,$ then it was proved by Dewan \textit{et al} that for every real or complex number $\alpha$ with $|\alpha|\geq k$ and each $r\geq 0$ $$…

Complex Variables · Mathematics 2013-04-03 N. A. Rather , Suhail Gulzar

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

Algebraic Geometry · Mathematics 2010-11-09 Philippe Pebay , J. Maurice Rojas , David C. Thompson

Let $K$ be a local field whose residue field has characteristic $p$ and let $L/K$ be a finite separable totally ramified extension of degree $n=up^{\nu}$. Let $\sigma_1,\dots,\sigma_n$ denote the $K$-embeddings of $L$ into a separable…

Number Theory · Mathematics 2016-08-29 Kevin Keating

In this paper, we are concerned with Jacobi polynomials $P_n^{(\alpha,\beta)}(x)$ on the Bernstein ellipse with motivation mainly coming from recent studies of convergence rate of spectral interpolation. An explicit representation of…

Numerical Analysis · Mathematics 2018-03-26 Haiyong Wang , Lun Zhang

In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…

Computational Complexity · Computer Science 2015-07-09 Ignacio Garcia-Marco , Pascal Koiran

We are interested in finding a nonlinear polynomial $P$ on $\mathbb{R}^n$ that solves the minimal surface equation. Even though no explicit solution is found in this article, we investigate constraints that a polynomial solution must obey.…

Differential Geometry · Mathematics 2026-03-18 Yifan Guo