Counting packings of generic subsets in finite groups

zbMATH Open1253.05013arXiv1011.0975MaRDI QIDQ456325FDOQ456325

Roland Bacher

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: A packing of subsets $mathcal{S}_1,\mathrm{...},mathcal{S}_n$ in a group $G$ is a sequence $(g_1,\mathrm{...},g_n)$ such that $g_{1}mathcal{S}_1,\mathrm{...},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,\mathrm{...},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.

Full work available at URL: https://arxiv.org/abs/1011.0975

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Stirling numberenumerative combinatoricsadditive number theoryadditive combinatoricspackings in groups

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Enumeration in graph theory (05C30) Arithmetic combinatorics; higher degree uniformity (11B30) Additive number theory; partitions (11P99)

Cited In (3)

• Title not available (Why is that?)
• Packings and coverings of groups: some results and open problems
• Abelian groups and packing by semicrosses

Uses Software

• OEIS

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)