Doctor Volker Gebhardt
SENIOR LECTURER,
Mathematics
Personal
Qualifications
- PhD University of Essen
UWS Organisational Unit (School / Division)
- Mathematics
Contact
| Email: | V.GEBHARDT@uws.edu.au |
|---|---|
| Extension: | 2688 |
| Mobile: | |
| Location: | Y.3.55 Penrith (Kingswood) |
| Website: |
PLEASE NOTE: obtaining information from this Directory must be for the legitimate purposes of doing business with and within the University of Western Sydney (UWS), and must not be used for unsolicited bulk e-mailing (spamming) or similar purposes.
Biography
Dr Volker Gebhardt completed his PhD at the University of Essen, Germany in the field of computational group theory. He spent the next four years as a post-doctoral researcher with the Computational Algebra group at the University of Sydney. In 2003-2004, he joined the University of Western Sydney as a casual lecturer and taught several Computing units. In July 2004, he took up a permanent position as a lecturer in Mathematics. His broad research interests lie in various areas of algebra and discrete mathematics; and he is especially interested in questions with an algorithmic or computational flavour.
This information has been contributed by Doctor Gebhardt.
Interests
- Combinatorial Group Theory
- Combinatorics
- Garside Groups
- Group Based Cryptography
Committees
- SCEM Work Plan Committee
Teaching
Previous Teaching Areas
- 200242 Mathematics for Engineers 3, 2012
- 300699 Discrete Structures and Complexity, 2012
Publications
Chapters in Books
- Gebhardt, V. (2006), 'Computer Aided Discovery of a Fast Algorithm for Testing Conjugacy in Braid Groups', Discovering Mathematics with Magma, Springer Verlag 3540376321.
Journal Articles
- Gebhardt, V. (2013), 'Generating random braids', Journal of Combinatorial Theory, Series A, 18.
- Gebhardt, V. (2013), 'Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs', Journal of Combinatorial Theory. Series A, 13.
- Gebhardt, V. and Gonzalez-Meneses, J. (2010), 'The cyclic sliding operation in Garside groups', Mathematische Zeitschrift, 30.
- Gebhardt, V. and Gonzalez-Meneses, J. (2010), 'Solving the conjugacy problem in Garside groups by cyclic sliding', Journal of Symbolic Computation, 28.
- Birman, J., Gebhardt, V. and Gonzalez-Meneses, J. (2008), 'Conjugacy in Garside groups II: structure of the ultra summit set', Groups, Geometry, and Dynamics, 49.
- Gonzalez-Meneses, J. and Gebhardt, V. (2008), 'On the cycling operation in braid groups', Discrete Applied Mathematics, 19.
- Birman, J., Gebhardt, V. and Gonzalez-Meneses, J. (2007), 'Conjugacy in Garside groups I: cyclings, powers and rigidity', Groups, Geometry, and Dynamics, 59.
- Birman, J., Gebhardt, V. and Gonzalez-Meneses, J. (2007), 'Conjugacy in Garside groups III: Periodic Braids', Journal of Algebra, 31.
- Gebhardt, V. (2006), 'Conjugacy search in braid groups: from a braid-based cryptography point of view', Applicable Algebra in Engineering, Communication and Computing, 20.
- Gebhardt, V. (2005), 'A new approach to the conjugacy problem in Garside groups', Journal of Algebra, 21.
Research
Current Projects
| Title: | Algebraic algorithms for investigating the space of bacterial genomes |
|---|---|
| Years: | 2013-01-01 - 2015-12-31 |
| ID: | P00020822 |
| UWS Researchers: | Andrew Francis and Volker Gebhardt |
| Funding: |
|
| Title: | Algorithmic Approaches to Braids and their Generalisations |
| Years: | 2010-09-30 - 2014-06-30 |
| ID: | P00016834 |
| UWS Researchers: | Volker Gebhardt |
| Funding: |
|
