| Título: | Fixed point polynomials of permutation groups |
| Autores: |
Harden , Christopher M Penman, David B |
| Fecha: | 2013-05-07 |
| Publicador: | Electronic Journal of Combinatorics |
| Fuente: |
Ver documento |
| Tipo: |
Article PeerReviewed |
| Tema: | QA Mathematics |
| Descripción: | In this paper we study, given a group $G$ of permutations of a finite set, the so-called fixed point polynomial $\sum_{i=0}^{n}f_{i}x^{i}$, where $f_{i}$ is the number of permutations in $G$ which have exactly $i$ fixed points. In particular, we investigate how root location relates to properties of the permutation group. We show that for a large family of such groups most roots are close to the unit circle and roughly uniformly distributed round it. We prove that many families of such polynomials have few real roots. We show that many of these polynomials are irreducible when the group acts transitively. We close by indicating some future directions of this research. |
| Idioma: | No aplica |