Related papers: A Class of Binomial Permutation Polynomials
Let $q>2$ be a prime power and $f=-{\tt x}+t{\tt x}^q+{\tt x}^{2q-1}$, where $t\in\Bbb F_q^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q$ is even and…
In this paper, we consider the degenerate poly-Bernoulli polynomials and present new and explicit formulas for computing them in terms of the degenerate Bernoulli polynomials and Stirling numbers of the second kind.
We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…
In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
In this paper, we consider Barnes' multiple Bernoulli and poly-Bernoulli mixed-type polynomials. From the properties of Sheffer sequences of these polynomials arising from umbrral calculus, we derive new and interesting identities.
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
In the paper, the authors find two closed forms involving the Stirling numbers of the second kind and in terms of a determinant of combinatorial numbers for the Bernoulli polynomials and numbers.
The variety of bicommutative algebras is the class of all nonassociative algebras satisfying the polynomial identities $(x_1x_2)x_3=(x_1x_3)x_2$ and $x_1(x_2x_3)=x_2(x_1x_3)$. In this paper we provide a complete description of varieties of…
We give an explicit formula for the Waring rank of every binary binomial form with complex coefficients. We give several examples to illustrate this, and compare the Waring rank and the real Waring rank for binary binomial forms.
We construct a new family of permutation group polynomials over finite fields of arbitrary characteristic, which are special types of bivariate local permutation polynomials. For this family, we explicitly construct their companion. We also…
We give necessary and sufficient conditions for a polynomial of the form x^r*(1+x^v+x^(2v)+...+x^(kv))^t to permute the elements of the finite field GF(q). Our results yield especially simple criteria in case (q-1)/gcd(q-1,v) is a small…
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…
For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…
We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new…
If a reduced bivariate polynomial is quasi-homogeneous, then its discriminant is a monomial. Over fields of characteristic $0$, we show that if one adds another simple condition, this becomes an equivalence. We also give a third equivalent…
We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.
We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…