Results 11 to 20 of about 57,503 (225)
Permutation-Based Block Code for Short Packet Communication Systems
This paper presents an approach to the construction of block error-correcting code for data transmission systems with short packets. The need for this is driven by the necessity of information interaction between objects of machine-type communication ...
Emil Faure +5 more
doaj +1 more source
Some Identities Involving Derangement Polynomials and Numbers and Moments of Gamma Random Variables
The problem of counting derangements was initiated by Pierre Rémond de Montmort in 1708. A derangement is a permutation that has no fixed points, and the derangement number Dn is the number of fixed point free permutations on an n element set ...
Lee-Chae Jang +3 more
doaj +1 more source
Permutation polynomials with Carlitz rank 2 [PDF]
Comment: 10 pages, comments are ...
José Alves Oliveira +1 more
openaire +3 more sources
Further Results on Permutation Polynomials over Finite Fields [PDF]
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields.
Ding, Cunsheng, Yuan, Pingzhi
core +2 more sources
On Polynomials of the Form xrf(x(q−1)/l)
We give a general criterion for permutation polynomials of the form xrf(x(q−1)/l), where r≥1, l≥1 and l∣(q−1). We employ this criterion to characterize several classes of permutation polynomials.
Amir Akbary, Qiang Wang
doaj +1 more source
Fixed Points of the Dickson Polynomials of the Second Kind
The permutation behavior of Dickson polynomials of the first kind has been extensively studied, while such behavior for Dickson polynomials of the second kind is less known.
Adama Diene, Mohamed A. Salim
doaj +1 more source
When Is the Number of True Different Permutation Polynomials Equal to 0?
In this paper, we have obtained the prime factorization form of positive integers N for which the number of true different fourth- and fifth-degree permutation polynomials (PPs) modulo N is equal to zero.
Lucian Trifina, Daniela Tarniceriu
doaj +1 more source
Permutation and complete permutation polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bassalygo, L. A., Zinoviev, V. A.
openaire +1 more source
Am-permutation polynomials [PDF]
AbstractWe introduce a class of polynomials which induce a permutation on the set of polynomials in one variable of degree less than m over a finite field. We call then Am-permutation polynomials. We also give three criteria to characterize such polynomials.
openaire +2 more sources
Toric matrix Schubert varieties and root polytopes (extended abstract) [PDF]
Start with a permutation matrix π and consider all matrices that can be obtained from π by taking downward row operations and rightward column operations; the closure of this set gives the matrix Schubert variety Xπ.
Laura Escobar, Karola Mészáros
doaj +1 more source

