Nonexistence of permutation binomials of certain shapes.
Masuda, Ariane M., Zieve, Michael E. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The number of permutation binomials over where and are primes.”
Nonexistence of permutation binomials of certain shapes.
Axial permutations of ω²
Paweł Klinga (2016)
Colloquium Mathematicae
Similarity:
We prove that every permutation of ω² is a composition of a finite number of axial permutations, where each axial permutation moves only a finite number of elements on each axis.
Permutation reconstruction from minors.
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation reconstruction.
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pattern avoidance classes and subpermutations.
Atkinson, M.D., Murphy, M.M., Ruškuc, N. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation separations and complete bipartite factorisations of .
Martin, Nigel, Stong, Richard (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A permutations representation that knows what “Eulerian” means.
Mantaci, Roberto, Rakotondrajao, Fanja (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On permutation polynomials over finite fields.
Mollin, R.A., Small, C. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Parity-alternating permutations and successions
Augustine Munagi (2014)
Open Mathematics
Similarity:
The study of parity-alternating permutations of {1, 2, … n} is extended to permutations containing a prescribed number of parity successions - adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using direct construction and elementary combinatorial techniques. Analogous results are derived for circular...
[unknown]
R. C. Entriger (1971)
Gaceta Matemática
Similarity:
An application of the theory of permutations in breaking the Enigma cipher
Marian Rejewski (1980)
Applicationes Mathematicae
Similarity:
Parking functions, stack-sortable permutations, and spaces of paths in the Johnson graph.
Zara, Catalin (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: