Counting packings of generic subsets in finite groups - Archive ouverte HAL
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2012

Counting packings of generic subsets in finite groups

Roland Bacher

Résumé

A packing of subsets $\mathcal S_1,\dots, \mathcal S_n$ in a group $G$ is a sequence $(g_1,\dots,g_n)$ such that $g_1\mathcal S_1,\dots,g_n\mathcal S_n$ are disjoint subsets of $G$. We give a formula for the number of packings if the group $G$ is finite and if the subsets $\mathcal S_1,\dots,\mathcal S_n$ satisfy a genericity condition. This formula can be seen as a generalization of the falling factorials which encode the number of packings in the case where all the sets $\mathcal S_i$ are singletons.
Fichier principal
Vignette du fichier
polyuniv1.pdf (233.24 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00531684 , version 1 (03-11-2010)
hal-00531684 , version 2 (02-03-2011)
hal-00531684 , version 3 (03-10-2012)

Identifiants

Citer

Roland Bacher. Counting packings of generic subsets in finite groups. The Electronic Journal of Combinatorics, 2012, 19 (3), pp.#P7. ⟨hal-00531684v3⟩

Collections

CNRS FOURIER INSMI
133 Consultations
164 Téléchargements

Altmetric

Partager

More