# Counting packings of generic subsets in finite groups

Abstract : 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.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [6 references]

https://hal.archives-ouvertes.fr/hal-00531684
Contributor : Roland Bacher <>
Submitted on : Wednesday, October 3, 2012 - 11:26:12 AM
Last modification on : Friday, March 29, 2019 - 11:28:05 AM
Document(s) archivé(s) le : Friday, January 4, 2013 - 3:57:20 AM

### Files

polyuniv1.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00531684, version 3
• ARXIV : 1011.0975

### Citation

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

Record views