Counting packings of generic subsets in finite groups

From MaRDI portal
Publication:456325




Abstract: A packing of subsets mathcalS1,...,mathcalSn in a group G is a sequence (g1,...,gn) such that g1mathcalS1,...,gnmathcalSn are disjoint subsets of G. We give a formula for the number of packings if the group G is finite and if the subsets mathcalS1,...,mathcalSn 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 mathcalSi are singletons.





Describes a project that uses

Uses Software





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)