Counting packings of generic subsets in finite groups

MaRDI QIDQ456325zbMATH OpenFDO

Authors Roland Bacher

Publication date 24 October 2012

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

Full work available at URL https://arxiv.org/abs/1011.0975, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p7

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

zbMATH Keywords

additive combinatoricsadditive number theoryenumerative combinatoricspackings in groupsStirling number

Mathematics Subject Classification ID

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

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.

Review text

Summary: A packing of subsets \(\mathcal S_1,\dots,\mathcal S_n\) in a group \(G\) is an element \((g_1,\dots,g_n)\) of \(G^n\) such that \(g_1\mathcal S_1,\dots,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,\dots,\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.

Recommendations

• Packings and coverings of groups: some results and open problems
• scientific article; zbMATH DE number 7069721
• scientific article; zbMATH DE number 1080076
• Packing and covering groups with subgroups
• Packing of permutations into Latin squares

Cited in

(5)

• Constructing subsets of a given packing index in Abelian groups
• scientific article; zbMATH DE number 7069721 (Why is no real title available?)
• Packings and coverings of groups: some results and open problems
• Posets arising from decompositions of objects in a monoidal category
• Abelian groups and packing by semicrosses

Describes a project that uses

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)