✦ LIBER ✦

q-Rook Polynomials and Matrices over Finite Fields

✍ Scribed by James Haglund

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 337 KB
Volume: 20
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.1998.0582

No coin nor oath required. For personal study only.

✦ Synopsis

Connections between q-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel's q-hit polynomial. Both this new statistic mat and another statistic for the q-hit polynomial recently introduced by Dworkin are shown to induce different multiset Mahonian permutation statistics for any Ferrers board. In addition, for the triangular boards they are shown to generate different families of Euler᎐Mahonian statistics. For these boards the family includes Denert's statistic den, and gives a new proof of Foata Ž . Ž . and Zeilberger's Theorem that exc, den is equidistributed with des, maj . The mat family appears to be new. A proof is also given that the q-hit polynomials are symmetric and unimodal.

📜 SIMILAR VOLUMES

Factoring Polynomials over Special Finit

Factoring Polynomials over Special Finite Fields

✍ Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas

Factoring Dickson Polynomials over Finit

Factoring Dickson Polynomials over Finite Fields

✍ Manjul Bhargava; Michael E. Zieve 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Factoring Polynomials Over Finite Fields

Factoring Polynomials Over Finite Fields: A Survey

✍ Joachim von zur Gathen; Daniel Panario 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 452 KB

This survey reviews several algorithms for the factorization of univariate polynomials over finite fields. We emphasize the main ideas of the methods and provide an up-to-date bibliography of the problem.

A Class of Polynomials over Finite Field

A Class of Polynomials over Finite Fields

✍ Arnaldo Garcia; Henning Stichtenoth 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points.

Groups of Permutation Polynomials over F

Groups of Permutation Polynomials over Finite Fields

✍ Richard M. Stafford 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.

Similarity to Symmetric Matrices over Fi

✍ Joel V. Brawley; Timothy C. Teitloff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 299 KB

It has been known for some time that every polynomial with coefficients from a finite field is the minimum polynomial of a symmetric matrix with entries from the same field. What have remained unknown, however, are the possible sizes for the symmetric matrices with a specified minimum polynomial and