Counting packings of generic subsets in finite groups
From MaRDI portal
Publication:456325
Abstract: A packing of subsets in a group is a sequence such that are disjoint subsets of . We give a formula for the number of packings if the group is finite and if the subsets 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 are singletons.
Recommendations
Cited in
(4)
This page was built for publication: Counting packings of generic subsets in finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456325)