Counting packings of generic subsets in finite groups

preprint2012arXivOpen access

Abstract

A packing of subsets S1,...,Sn\mathcal S_1,..., \mathcal S_n in a group GG is a sequence (g1,...,gn)(g_1,...,g_n) such that g1S1,...,gnSng_1\mathcal S_1,...,g_n\mathcal S_n are disjoint subsets of GG. We give a formula for the number of packings if the group GG is finite and if the subsets S1,...,Sn\mathcal S_1,...,\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 Si\mathcal S_i are singletons.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.