Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 26, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Gyula Károlyi (Eötvös Lorand University)

Set addition in noncommutative groups

According to a classical result due to Cauchy and Davenport, if A and B are sets of congruence classes modulo a prime p, then at least |A|+|B|-1 different classes are represented by the Minkowski sum A+B (unless this number already exceeds the prime p). It is also known that, apart from some trivial or pathological cases, equality occurs only if A and B represent arithmetic progressions of the same difference.

Generalizations of these theorems to commutative groups in general are also widely known. In this talk I will present a natural counterpart of these results for the nonabelian case. The combinatorial proofs depend on the structure of group extensions.

I plan this talk to be pretty self-contained, so even if you forgot most of you may have learnt about groups, you will be able to follow it.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login