𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A problem with permutations, I

✍ Scribed by E.T Parker; Gerald A Dyer

Book ID
103509367
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
73 KB
Volume
26
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Enumerating Permutation Polynomials I: P
Enumerating Permutation Polynomials I: Permutations with Non-Maximal Degree
✍ Claudia Malvenuto; Francesco Pappalardi πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 154 KB

Let C be a conjugation class of permutations of a finite field F q . We consider the function N C Γ°qÞ defined as the number of permutations in C for which the associated permutation polynomial has degree 5q Γ€ 2. In 1969, Wells proved a formula for N Β½3 Γ°qÞ where Β½k denotes the conjugation class of k

A Problem in Permutations: the Game of '
A Problem in Permutations: the Game of 'Mousetrap'
✍ Daniel J. Mundfrom πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 190 KB

The game of 'Mousetrap, a problem in permutations, first introduced by Arthur Cayley in 1857 and independently addressed by Cayley and Adolph Steen in 1878, has been largely unexamined since. The game involves permutations of \(n\) cards numbered consecutively from 1 to \(n\). The cards are laid out

Convex solution of a permutation problem
Convex solution of a permutation problem
✍ Marko StoΕ‘iΔ‡; Manuel Marques; JoΓ£o Paulo Costeira πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 164 KB

In this paper, we show that a problem of finding a permuted version of k vectors from R N such that they belong to a prescribed rank r subset, can be solved by convex optimization. We prove that under certain generic conditions, the wanted permutation matrix is unique in the convex set of doubly-sto