相关论文: Permutation Polynomials modulo m

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…

Polynomially-recursive sequences generally have a periodic behavior mod $m$. In this paper, we analyze the period mod $m$ of a second order polynomially-recursive sequence. The problem originally comes from an enumeration of avoiding…

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…

We find a combinatorial setting for the coefficients of the Boros-Moll polynomials $P_m(a)$ in terms of partially 2-colored permutations. Using this model, we give a combinatorial proof of a recurrence relation on the coefficients of…

In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over $\F_{q^r}$. In addition, we present a class of complete permutation multinomials, which…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

Let $a$ and $m>0$ be integers. We show that for any integer $b$ relatively prime to $m$, the set $\{a^n+bn:\ n=1,\ldots,m^2\}$ contains a complete system of residues modulo $m$. We also pose several conjectures for further research; for…

Very recently, Tu et al. presented a sufficient condition about $(a_1,a_2,a_3)$, see Theorem 1.1, such that $f(x) = x^{3\cdot 2^m} + a_1 x^{2^{m+1}+1}+ a_2 x^{2^m+2} + a_3 x^3$ is a class of permutation polynomials over $\gf_{2^{n}}$ with…

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

In this paper we establish six bijections between a particular class of polyominoes, called deco polyominoes, enumerated according to their directed height by n!, and permutations. Each of these bijections allows us to establish different…

We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…

Permutation polynomials and their compositional inverses have wide applications in cryptography, coding theory, and combinatorial designs. Motivated by several previous results on finding compositional inverses of permutation polynomials of…

We determine all permutation polynomials among several families of polynomials over $\mathbb{F}_{q^3}$ for arbitrary prime powers $q$. We obtain some new families of permutation polynomials over $\mathbb{F}_{q^3}$ with simple coefficients…

In this paper we study admissible polynomials. We establish an estimate for the number of admissible polynomials of degree $n$ with coeffients $a_i$ satisfying $0\leq a_i\leq H$ for a fixed $H$, for $i=0,1,2, \ldots, n-1$. In particular,…