On the size of coset unions (Q2137072)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7526632
Language Label Description Also known as
default for all languages
No label defined
    English
    On the size of coset unions
    scientific article; zbMATH DE number 7526632

      Statements

      On the size of coset unions (English)
      0 references
      0 references
      0 references
      16 May 2022
      0 references
      Let a natural number \(n \in \mathbb N\) be given, \(G\) be any finite group, \(H_1, \dots, H_n\) be subgroups of \(G\) and \(g_1, \dots, g_n \in G\). The authors prove that there exists some constant \(\gamma_n < 1\) such that whenever \(g_1H_1 \cup \dots \cup g_nH_n \ne G\) one has \[ |g_1H_1 \cup \dots \cup g_nH_n| \le \gamma_n |G|\ . \] They show that this result is true with \(\gamma_n = \frac {2n!-1} {2n!}\), and conjecture that \(\gamma_n = \frac {2^n-1} {2^n}\) would be the optimal value for this constant. As partial results, they show that their conjecture holds for \(n \le 5\) if one restricts to subgroups instead of cosets (i.e. \(g_i \in H_i\) for all \(i\)), and also holds for elementary abelian \(p\)-groups.
      0 references
      0 references
      covering of a group
      0 references
      coset
      0 references

      Identifiers