Counting packings of generic subsets in finite groups

Details Counting packings of generic subsets in finite groups Counting packings of generic subsets in finite groups

2010-11-03

arxiv.org/abs/1011.0975v2

Mathematics

Combinatorics

Scientific paper

A packing of subsets $\mathcal S_1,..., \mathcal S_n$ in a group $G$ is a
sequence $(g_1,...,g_n)$ such that $g_1\mathcal S_1,...,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,...,\mathcal S_n$ satisfy
a genericity condition.

Affiliated with

Also associated with

No associations

Rating

Counting packings of generic subsets in finite groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting packings of generic subsets in finite groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting packings of generic subsets in finite groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603875