Ákos Seress
Ákos Seress (born November 24, 1958 in Budapest , † February 13, 2013 in Columbus (Ohio) ) was a Hungarian mathematician who studied combinatorics and group theory.
Seress studied at the Loránd Eötvös University in Budapest and received her doctorate in 1985 from the Ohio State University with Dijen Ray-Chaudhuri . The topic of the dissertation was the gossip problem : n People exchange their personal gossip (and only this) in one-to-one conversations over the phone, how many conversations are necessary so that everyone knows all the gossip? He then returned to Hungary and did research at the Alfred Renyi Institute of the Hungarian Academy of Sciences. In 1986 he published with Paul Erdős , edited the magazine Combinatorica and began his collaboration with László Babai and his preoccupation with algorithmic group theory.
In 1989 he became an assistant professor at Ohio State University, an associate professor in 1995 and a professor in 2000. He was visiting professor at the University of Western Australia and one year at RWTH Aachen with a Humboldt Research Award (with Joachim Neubüser ). He died of cancer when he was only 54.
He implemented algorithms for permutation groups within the GAP computer algebra system.
Most recently, with Harald Helfgott , he solved a long, open conjecture about the diameter of permutation groups.
In 2006 he was invited speaker at the International Congress of Mathematicians in Madrid (A unified approach to computations with permutation and matrix groups).
Fonts
- Permutation Group Algorithms , Cambridge University Press 2003
- with William Kantor : Black box classical groups , Memoirs AMS, 2001
- Construction of 2-Closed M-Representations , Proc. International Symposium on Symbolic and Algebraic Computation (ISSAC '12) 2012, 311-318
- with Harald Helfgott : On the diameter of permutation groups , appears in Annals of Mathematics, Arxiv, 2011
- with KT Arasu Codes and Designs , De Gruyter 2002
- with A. Hulpke, R. Liebler, T. Pentilla Finite Geometries, Groups and Computation , De Gruyter 2006
- An introduction to computational group theory , Notices AMS, June / July 1997, online
- Nearly linear time algorithms for permutation groups: An interplay between theory and practice , Acta Appl. Math., 52, 1998, 183-207
Web links
- John J. O'Connor, Edmund F. Robertson : Ákos Seress. In: MacTutor History of Mathematics archive .
- Publications
Individual evidence
- ↑ Publication on this: Quick gossiping without duplicate transmissions , Graphs and Combinatorics 2 (1986), 363-381. He has already dealt with one variant before: Gossiping old ladies , Discrete Mathematics 46 (1983), 75–81
| personal data | |
|---|---|
| SURNAME | Seress, Ákos |
| BRIEF DESCRIPTION | Hungarian mathematician |
| DATE OF BIRTH | November 24, 1958 |
| PLACE OF BIRTH | Budapest |
| DATE OF DEATH | February 13, 2013 |
| Place of death | Columbus, Ohio |