English
Related papers

Related papers: Integral polynomials with small discriminants and …

200 papers

In this paper we obtain new results concerning maximum modulus of the polar derivative of a polynomial with restricted zeros. Our results generalize and refine upon the results of Aziz and Shah [An integral mean estimate for polynomial,…

Complex Variables · Mathematics 2009-07-17 M. Shakeri , M. Bidkham , M. Eshaghi Gordji

This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…

Optimization and Control · Mathematics 2024-03-08 Marcel Celaya , Stefan Kuhlmann , Robert Weismantel

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…

Data Structures and Algorithms · Computer Science 2022-08-02 Mitali Bafna , Jun-Ting Hsieh , Pravesh K. Kothari , Jeff Xu

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. We study two natural determinants of order $rD$ with Bernoulli polynomials and we present…

Number Theory · Mathematics 2024-05-01 Mircea Cimpoeas

We classify the graphs that can occur as the graph of rational preperiodic points of a quadratic polynomial over $\bold Q$, assuming the conjecture that it is impossible to have rational points of period $4$ or higher. In particular, we…

Number Theory · Mathematics 2016-09-06 Bjorn Poonen

Let $\mathbb{F}_q$ be a finite field with $q=p^e$ elements, where $p$ is a prime and $e\geq 1$ is an integer. Let $\ell<n$ be two positive integers. Fix a monic polynomial $u(x)=x^n +u_{n-1}x^{n-1}+\cdots +u_{\ell+1}x^{\ell+1} \in…

Number Theory · Mathematics 2017-02-09 Haiyan Zhou , Li-Ping Wang , Weiqiong Wang

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

Optimization and Control · Mathematics 2021-05-12 Amir Ali Ahmadi , Cemil Dibek , Georgina Hall

Polynomial and spline quasi-interpolants (QIs) are practical and effective approximation operators. Among their remarkable properties, let us cite for example: good shape properties, easy computation and evaluation (no linear system to…

Numerical Analysis · Mathematics 2025-10-20 Paul Sablonniere

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 prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

Number Theory · Mathematics 2020-01-01 Vesselin Dimitrov

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

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

Symbolic Computation · Computer Science 2017-12-13 Mark Giesbrecht , Joseph Haraldson , George Labahn

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

Combinatorics · Mathematics 2018-09-18 Daniele Bartoli , Kai-Uwe Schmidt

In this article we bound the number of remarkable values of a polynomial vector field. The proof is short and based on Jouanolou's theorem about rational first integrals of planar polynomial derivations. Our bound is given in term of the…

Classical Analysis and ODEs · Mathematics 2015-02-13 Guillaume Chèze

We estimate the number of primes represented by a general quadratic polynomial with discriminant $\Delta$, assuming that the corresponding real character is exceptional.

Number Theory · Mathematics 2020-11-12 Fernando Chamizo , Jorge Jiménez Urroz

Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…

Commutative Algebra · Mathematics 2021-05-28 Matías R. Bender , Jean-Charles Faugère , Angelos Mantzaflaris , Elias Tsigaridas

In this paper we introduce the polynomials $\{d_n^{(r)}(x)\}$ and $\{D_n^{(r)}(x)\}$ given by $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k} \ (n\ge 0)$, $D_0^{(r)}(x)=1,\ D_1^{(r)}(x)=x$ and…

Number Theory · Mathematics 2017-11-16 Zhi-Hong Sun

We consider the sequence of polynomials $W_n(x)$ defined by the recursion $W_n(x)=(ax+b)W_{n-1}(x)+dW_{n-2}(x)$, with initial values $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a,b,d,t,r$ are real numbers, $a,t>0$, and $d<0$. We show that every…

Classical Analysis and ODEs · Mathematics 2015-03-19 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Mathematical Physics · Physics 2011-09-27 H. Azad , A. Laradji , M. T. Mustafa

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

Optimization and Control · Mathematics 2025-12-01 Nguyen Hong Duc , Vu Trung Hieu