English
Related papers

Related papers: A Class of Binomial Permutation Polynomials

200 papers

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…

Number Theory · Mathematics 2013-03-05 Xiang-dong Hou

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.

Number Theory · Mathematics 2015-03-31 Dae San Kim , Taekyun Kim

We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.

Combinatorics · Mathematics 2012-10-02 Leonid Bedratyuk

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…

Combinatorics · Mathematics 2007-05-23 Sophie Huczynska , Vincent Vatter

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…

Combinatorics · Mathematics 2026-01-23 Alejandro González Nevado

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…

Number Theory · Mathematics 2021-04-28 Lucas Reis , Qiang Wang

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…

Combinatorics · Mathematics 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

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.

Number Theory · Mathematics 2013-12-30 D. S. Kim , T. Kim , T. Komatsu

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…

Computational Complexity · Computer Science 2011-02-01 Yann Strozecki

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.

Combinatorics · Mathematics 2015-09-15 Feng Qi , Robin J. Chapman

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…

Rings and Algebras · Mathematics 2026-05-12 Vesselin Drensky , Bekzat Zhakhayev

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.

Commutative Algebra · Mathematics 2021-10-13 Laura Brustenga i Moncusí , Shreedevi K. Masuti

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…

Combinatorics · Mathematics 2026-02-03 Sartaj Ul Hasan , Ramandeep Kaur , Hridesh Kumar

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…

Number Theory · Mathematics 2013-10-08 Michael E. Zieve

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…

Information Theory · Computer Science 2019-09-19 Kangquan Li , Longjiang Qu , Chao Li , Hao Chen

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…

Number Theory · Mathematics 2023-11-28 P Vanchinathan , Anitha G

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…

Number Theory · Mathematics 2013-12-10 Michael E. Zieve

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…

Commutative Algebra · Mathematics 2025-06-04 David Bradley-Williams , Pablo Cubides Kovacsics , Immanuel Halupczok

We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.

Combinatorics · Mathematics 2017-10-24 John Shareshian , Russ Woodroofe

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…

Number Theory · Mathematics 2025-10-13 Suman Mondal
‹ Prev 1 8 9 10 Next ›