Related papers: On polynomial solutions of PDE

We consider the negative polynomial Pell's equation $P^2(X)-D(X)Q^2(X)=-1$, where $D(X)\in \mathbb{Z}[X]$ be some fixed, monic, square-free, even degree polynomials. In this paper, we investigate the existence of polynomial solutions $P(X),…

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

The existence of decompositions of the form $f=P\cdot q+r$ with $P_k^{\ast}\left( D\right) r=0$, where $f$ is entire, $P$ a polynomial and $P^{\ast}_k$ the principal part of $P$ with its coefficients conjugated, was achieved in…

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…

Given a set $\Gamma$ of low-degree k-dimensional varieties in $\mathbb{R}^n$, we prove that for any $D \ge 1$, there is a non-zero polynomial $P$ of degree at most $D$ so that each component of $\mathbb{R}^n \setminus Z(P)$ intersects…

The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…

Given a polynomial map f on the Euclidean n-space and a vector q, the polynomial complementarity problem, PCP(f,q), is the nonlinear complementarity problem of finding a nonnegative vector x such that y=f(x)+q is nonnegative and orthogonal…

We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

In the current paper we are seeking P1(y),P2(y),P3(y) with the highest possible degree polynomials with integer coefficients, and Q(y) via the lowest possible degree polynomial, such that P1(y)^3+P2(y)^3+P3(y)^3=Q(y). Actually, the solution…

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$ $$…

For each integer $n\geq 1$ we consider the unique polynomials $P, Q\in\mathbb{Q}[x]$ of smallest degree $n$ that are solutions of the equation $P(x)x^{n+1}+Q(x)(x+1)^{n+1}=1$. We derive numerous properties of these polynomials and their…

Let f be a square-free polynomial in Fq[t][x] where Fq is a field of q elements. We view f as a polynomial in the variable x with coefficients in the ring Fq[t]. We study squarefree values of f in sparse subsets of Fq[t] which are given by…

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

We characterize the rational solutions to a KdV-like equation which are generated from polynomial solutions to the corresponding generalized bilinear equation. We use a particular class of polynomials satisfying a quadratic difference…

Let $p$ be a prime number, $m$ be an even positive integer, and $\mathbb{F}_q$ be a finite field with $q = p^m$ elements. In this paper, we compute the number of solutions with all coordinates in $\mathbb{F}_q^*$ for diagonal equations of…

We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…

We develop algorithms for writing a polynomial as sums of powers of low degree polynomials. Consider an $n$-variate degree-$d$ polynomial $f$ which can be written as $$f = c_1Q_1^{m} + \ldots + c_s Q_s^{m},$$ where each $c_i\in…

By Descartes' rule of signs, a real degree $d$ polynomial $P$ with all nonvanishing coefficients, with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$) has $pos\leq c$ positive and $neg\leq p$…