Dmitry Feichtner-Kozlov (born 16 December 1972, in Tomsk, Russia) is a Russian-German mathematician.
Contents
He works in the field of Applied and Combinatorial Topology, where he publishes under the name Dmitry N. Kozlov.
Dmitry Feichtner-Kozlov (born 16 December 1972, in Tomsk, Russia) is a Russian-German mathematician.
He works in the field of Applied and Combinatorial Topology, where he publishes under the name Dmitry N. Kozlov.
Feichtner-Kozlov obtained his PhD from the Royal Institute of Technology, Stockholm in 1996, with thesis Extremal Combinatorics, Weighting Algorithms, and Topology of Subspaces Arrangements written under the direction of Anders Björner. [1] 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. [2]
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, [3] [ circular reference ] Goran Gustafsson prize 2004, [4] European Prize in Combinatorics 2005. [5] [ circular reference ] 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. [6]
He is a managing editor of the Journal of Applied and Computational Topology, [7] published by Springer-Verlag.
Feichtner-Kozlov is married to Eva-Maria Feichtner, with whom he frequently collaborates mathematically. [8]
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science.
Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.
In mathematics, combinatorial topology was an older name for algebraic topology, dating from the time when topological invariants of spaces were regarded as derived from combinatorial decompositions of spaces, such as decomposition into simplicial complexes. After the proof of the simplicial approximation theorem this approach provided rigour.
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object.
Lists of mathematics topics cover a variety of topics related to mathematics. Some of these lists link to hundreds of articles; some link only to a few. The template to the right includes links to alphabetical lists of all mathematical articles. This article brings together the same content organized in a manner better suited for browsing. Lists cover aspects of basic and advanced mathematics, methodology, mathematical statements, integrals, general concepts, mathematical objects, and reference tables. They also cover equations named after people, societies, mathematicians, journals, and meta-lists.
In geometry, an arrangement of lines is the subdivision of the plane formed by a collection of lines. Bounds on the complexity of arrangements have been studied in discrete geometry, and computational geometers have found algorithms for the efficient construction of arrangements.
Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
Digital topology deals with properties and features of two-dimensional (2D) or three-dimensional (3D) digital images that correspond to topological properties or topological features of objects.
In mathematics, real algebraic geometry is the sub-branch of algebraic geometry studying real algebraic sets, i.e. real-number solutions to algebraic equations with real-number coefficients, and mappings between them.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
Mathematical Sciences Publishers is a nonprofit publishing company run by and for mathematicians. It publishes several journals and the book series Geometry & Topology Monographs. It is run from a central office in the Department of Mathematics at the University of California, Berkeley.
The mathematical discipline of topological combinatorics is the application of topological and algebro-topological methods to solving problems in combinatorics.
János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.
Jiří (Jirka) Matoušek was a Czech mathematician working in computational geometry and algebraic topology. He was a professor at Charles University in Prague and the author of several textbooks and research monographs.
Mathematics is a broad subject that is commonly divided in many areas that may be defined by their objects of study, by the used methods, or by both. For example, analytic number theory is a subarea of number theory devoted to the use of methods of analysis for the study of natural numbers.
Richard M. Pollack was an American geometer who spent most of his career at the Courant Institute of Mathematical Sciences at New York University, where he was Professor Emeritus until his death.
Michael Jeffrey Larsen is an American mathematician, a distinguished professor of mathematics at Indiana University Bloomington.
Eva-Maria Elisabeth Feichtner is a German mathematician, the founder and director of the Institute for Algebra, Geometry, Topology and their Applications at the University of Bremen, where she is professor of algebra and vice president of internationalization and diversity. Topics in her research have included tropical geometry, matroid polytopes, Chow rings, toric varieties, lattices and semilattices, and the wonderful compactification.
Sergio Rajsbaum is a Mexican computer scientist, working in the field of Theoretical Computer Science, specifically concurrent and distributed computing.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
