An Approach to the Herzog-Schönheim Conjecture Using Automata

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Let G be a group and H1,.., Hs be subgroups of G of indices d1,...,ds respectively. In 1974, M. Herzog and J. Schönheim conjectured that if {Hiαi}i=1i=s, (Formula Presented), is a coset partition of G, then d1,...,ds cannot be distinct. In this paper, we present a new approach to the Herzog-Schönheim conjecture based on automata and present a translation of the conjecture as a problem on automata.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 24th International Conference, DLT 2020, Proceedings
EditorsNataša Jonoska, Dmytro Savchuk
PublisherSpringer
Pages55-68
Number of pages14
ISBN (Print)9783030485153
DOIs
StatePublished - 2020
Event24th International Conference on Developments in Language Theory, DLT 2020 - Tampa, United States
Duration: 11 May 202015 May 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12086 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Conference on Developments in Language Theory, DLT 2020
Country/TerritoryUnited States
CityTampa
Period11/05/2015/05/20

Bibliographical note

Publisher Copyright:
© Springer Nature Switzerland AG 2020.

Keywords

  • Automata
  • Coset partitions
  • Free groups
  • The Herzog-Schönheim conjecture

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'An Approach to the Herzog-Schönheim Conjecture Using Automata'. Together they form a unique fingerprint.

Cite this