Let \(R\) be a commutative ring with 1 , let \(R\left[X_{1}, \ldots, X_{n}\right]\) be the polynomial ring in \(X_{1}, \ldots, X_{n}\) over \(R\) and let \(G\) be an arbitrary group of permutations of \(\left\{X_{1}, \ldots, X_{n}\right\}\). The paper presents an algorithm for computing a small fini
β¦ LIBER β¦
A New Criterion for Permutation Polynomials
β Scribed by G. Turnwald
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 803 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1071-5797
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computing Bases for Rings of Permutation
β
Manfred GΓΆbel
π
Article
π
1995
π
Elsevier Science
π
English
β 225 KB
A note on permutation polynomials and fi
β
David Gluck
π
Article
π
1990
π
Elsevier Science
π
English
β 235 KB
Polynomials over Finite Fields Which Com
β
C.Y. Chao
π
Article
π
1994
π
Elsevier Science
π
English
β 586 KB
Fields that admit a nonlinear permutatio
β
J.V Brawley; Robert Gilmer
π
Article
π
1989
π
Elsevier Science
π
English
β 612 KB
Bases for Polynomial Invariants of Conju
β
Samir Khuller; Manfred GΓΆbel; Jochen Walter
π
Article
π
1999
π
Elsevier Science
π
English
β 41 KB
The major index polynomial for conjugacy
β
Michelle L. Wachs
π
Article
π
1991
π
Elsevier Science
π
English
β 628 KB
Garsia (1988) gives a remarkably simple expression for the major index enumerator for permutations of a fixed cycle type evaluated at a primitive root of unity. He asks for a direct combinatorial proof of this identity. Here we give such a combinatorial derivation.