Dmitry Feichtner-Kozlov

Dmitry Feichtner-Kozlov (born December 16, 1972 in Tomsk, Russia) is a Russian-German mathematician.

Dmitry Feichtner-Kozlov

He works in the field of Applied and Combinatorial Topology, where he publishes under the name Dmitry N. Kozlov.

Biography

Feichtner-Kozlov obtained his Ph.D. from the Royal Institute of Technology, Stockholm in 1996. In 2004, after longer stays at the Mathematical Sciences Research Institute in Berkeley, California, the Massachusetts Institute of Technology, the Institute for Advanced Study in Princeton, New Jersey, the University of Washington in Seattle, the University of Bern, and the Royal Institute of Technology, he assumed the position of Assistant Professor at ETH Zurich, Switzerland.

Since 2007 he works at the University of Bremen, Germany, where he holds the Chair of Algebra and Geometry, and is the director of the Institute for Algebra, Geometry, Topology and their applications.[1]

Feichtner-Kozlov has done research on various topics, such as: topological methods in combinatorics, including applications to graph colorings; combinatorially defined polyhedral and cell complexes; combinatorial structures in geometry and topology, such as stratifications and compactifications of spaces; combinatorial aspects of chain complexes, such as coboundary expansion. He has also done interdisciplinary work, e.g., developing rigorous mathematical methods in theoretical distributed computing.

Feichtner-Kozlov is the recipient of the following prizes: Wallenberg prize 2003,[2] Goran Gustafsson prize 2004,[3] European Prize in Combinatorics 2005.[4] The book "Distributed Computing through Combinatorial Topology", which he wrote together with computer scientists Maurice Herlihy and Sergio Rajsbaum has been selected as a Notable Book on the Best of Computing 2013 list by the Association for Computing Machinery.[5][6]

He is a managing editor of the Journal of Applied and Computational Topology,[7] published by Springer-Verlag.

Selected publications
  • Distributed Computing through Combinatorial Topology, with Maurice Herlihy, Sergio Rajsbaum, Elsevier, 2013, 366 pages. ISBN 978-0-124-04578-1
  • Combinatorial Algebraic Topology, Springer-Verlag, 2008, 390 pages. ISBN 978-3-540-71961-8
  • Proof of the Lovász Conjecture, with Eric Babson, Annals of Mathematics 165 (2007), 965–1007.
  • Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes, book chapter in: IAS/Park City Mathematics Series 14, Amer. Math. Soc., Providence, RI; Institute for Advanced Study, Princeton, NJ, 2007, pp. 262–330.
gollark: Wrong.
gollark: You're supposed to minimise the average number of frustrated preferences for some reason.
gollark: I have no idea.
gollark: Apparently negative average preference utilitarianism is perfect and without flaw™ and fixes this somehow.
gollark: Worrying.

See also

References
  1. http://www.alta.uni-bremen.de
  2. https://sv.wikipedia.org/wiki/Wallenbergpriset
  3. http://gustafssonsstiftelser.se/sid-4/stiftelse-1-uukth/pristagare/tidigare-pristagare-uukth/
  4. https://en.wikipedia.org/wiki/European_Prize_in_Combinatorics
  5. http://www.computingreviews.com/recommend/bestof/notableitems_2013.cfm
  6. http://www.uni-bremen.de/universitaet/presseservice/pressemitteilungen/einzelanzeige/news/detail/News/best-of-2013-bremer-mathematiker-dmitry-feichtner-kozlov-auf-computing-bestenliste.html?cHash=a683dc60b3454cc13d135d7d1beedc6d
  7. https://www.springer.com/mathematics/geometry/journal/41468
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.