Search the site

Table of contents for this issue | Previous article | Next article
Stéphane Vinatier
Permuting the partitions of a prime
Journal de théorie des nombres de Bordeaux, 21 no. 2 (2009), p. 455-465, doi: 10.5802/jtnb.682
Article PDF | Reviews MR 2541437 | Zbl pre05620662
Keywords: Partitions of a prime; sums of resolvents; multinomials.

Résumé - Abstract

Given an odd prime number $p$, we characterize the partitions $\underline{\ell }$ of $p$ with $p$ non negative parts $\ell _0\ge \ell _1\ge \ldots \ge \ell _{p-1}\ge 0$ for which there exist permutations $\sigma ,\tau $ of the set $\lbrace 0,\ldots ,p-1\rbrace $ such that $p$ divides $\sum _{i=0}^{p-1}i\ell _{\sigma (i)}$ but does not divide $\sum _{i=0}^{p-1}i\ell _{\tau (i)}$. This happens if and only if the maximal number of equal parts of $\underline{\ell }$ is less than $p-2$. The question appeared when dealing with sums of $p$-th powers of resolvents, in order to solve a Galois module structure problem.


[A] Andrews G.E., The theory of partitions. Encyclopedia of Mathematics and its applications 2, Addison-Wesley, 1976.  MR 557013 |  Zbl 0655.10001
[DM] Dixon J.D., Mortimer B., Permutation groups. Graduate Texts in Mathematics 163, Springer-Verlag, New York, 1996.  MR 1409812 |  Zbl 0951.20001
[V] Vinatier S., Galois module structure in wealky ramified $3$-extensions. Acta Arithm. 119 (2005), no. 2, 171–186.  MR 2167720 |  Zbl 1075.11071