Related papers: From $r$-Linearized Polynomial Equations to $r^m$-…

Given $k \ge 2$ polynomials in $d \ge 1$ variables with coefficients in a field of characteristic $0$, such that no two are linearly dependent, we show that for any integer $r$ greater than $\max\left\{k {k-1 \choose 2}, 2\right\}$, the…

We consider the Min-$r$-Lin$(Z_m)$ problem: given a system $S$ of length-$r$ linear equations modulo $m$, find $Z \subseteq S$ of minimum cardinality such that $S-Z$ is satisfiable. The problem is NP-hard and UGC-hard to approximate in…

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

In previous work we computed the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb{F}}_q[x,y,x^{-1}, y^{-1}]$ of two-variable Laurent polynomials over a finite field: it turned out that $C_n(q)$ is a palindromic…

Let $(P_n)_n$ and $(Q_n)_n$ be two sequences of monic polynomials linked by a type structure relation such as $$ Q_{n}(x)+r_nQ_{n-1}(x)=P_{n}(x)+s_nP_{n-1}(x)+t_nP_{n-2}(x)\;, $$ where $(r_n)_n$, $(s_n)_n$ and $(t_n)_n$ are sequences of…

Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…

Let $S_n$ denote the symmetric group on $\{1,2,\ldots,n\}$. For two permutations $u, v\in S_n$ such that $u\leq v$ in the Bruhat order, let $R_{u,v}(q)$ and $\R_{u,v}(q)$ denote the Kazhdan-Lusztig $R$-polynomial and $\R$-polynomial,…

In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…

Let $f(t_1, \ldots, t_r, X)\in \mathbb{Z}[t_1, \ldots, t_r,X]$ be irreducible and let $a_1, \ldots, a_r\in \mathbb{Z} \smallsetminus \{0,\pm 1\}$. Under a necessary ramification assumption on $f$, and conditionally on the Generalized…

In this paper, we analyze the solutions of the following non-linear differential-difference equations f^n(z) +\omega f^(n-1)f'(z) +p(z)f(z+c) = p_1e^{\alpha}_1z +p_2e^{\alpha}_2z and f^n(z)f'(z) +q(z)e^Q(z)f(z+c) = p_1e^{\alpha}_1z…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

In this paper we construct planar polynomials of the type $f_{A,B}(x)=x(x^{q^2}+Ax^{q}+Bx)\in \mathbb{F}_{q^3}[x]$, with $A,B \in \mathbb{F}_{q}$. In particular we completely classify the pairs $(A,B)\in \mathbb{F}_{q}^2$ such that…

In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

Let $q$ be an odd prime and $f(x)$, $g(x)$ be polynomials with integer coefficients. If the system of congruences $f(x) \equiv g(x) \equiv 0 \pmod{q}$ has $\ell$ solutions, then $R\left(f(x),g(x)\right)\equiv 0 \pmod{q^\ell}$, where…

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…

Let G be the absolute Galois group of a global field. Let r1 and r2 be two p-adic, finite dimensional representations of G. Then there exists a finite number of primes q such that if the characteristic polynomials of r1(Frob_q) and…

The solution of equations from the title is well known since the Euler's time. However, its proof in the case of multiple roots of the characteristic polynomial is rather long and technical and even appearance of the factors $x^m$ looks…

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…

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…