Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Conjecture

Herzog-Schonheim Conjecture

Combinatorics

The Herzog-Schonheim conjecture, in group theory, is a combinatorial problem posed by Marcel Herzog and Jochanan Schonheim in 1974. It considers a finite system of left cosets of subgroups of a group that together form a partition of the group into more than one part, and conjectures that the indices of those subgroups cannot then all be distinct. By contrast, when repeated indices are allowed, partitioning a group into cosets is easy: any subgroup of finite index k partitions the group into k left cosets of itself. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Prize Status
Prize Status (category)
No Prize Offered 1
Classification
Resolution Status
Open 1
Proposed Year
1974 2
Connections

In Branch

Source Herzog-Schönheim conjecture (Wikipedia)

Posed By

Source Herzog-Schonheim Conjecture (Wikipedia)
Source Herzog-Schonheim Conjecture (Wikipedia)
Sources
1. List of Unsolved Problems in Mathematics (Wikipedia)
  • Group theory section, Herzog-Schonheim conjecture entry
    if a finite system of left cosets of subgroups of a group G form a partition of G, then the finite indices of said subgroups cannot be distinct.
  • Lead section
View the Source
2. Herzog-Schonheim Conjecture (Wikipedia)
Wikimedia Foundation
  • Lead section
    posed by Marcel Herzog and Jochanan Schönheim in 1974
  • Posed By: Marcel Herzog, Lead
    posed by Marcel Herzog and Jochanan Sch
  • Posed By: Jochanan Schönheim, Lead
    posed by Marcel Herzog and Jochanan Sch
View the Source
Herzog-Schönheim conjecture (Wikipedia)
In Branch: Group Theory, Lead paragraph
Quote, In Branch: Group Theory, Lead paragraph
In mathematics, the Herzog-Schönheim conjecture is a combinatorial problem in the area of group theory, posed by Marcel Herzog and Jochanan Schönheim in 1974.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.