Vitaliy Kurlin

Papers

Total Citations

H-Index

About

Vitaliy Kurlin is a mathematician whose research bridges topology, geometry, and data science, with a particular focus on applications in robotics and materials science. His most-cited work centers on computing braid groups of graphs, where he developed algorithms that write down explicit presentations of these groups. A key contribution is a motion planning algorithm for robots moving without collisions on a connected graph, achieving linear complexity in the number of edges and quadratic in the number of robots—a significant advance for automated coordination. This work, published in 2012 and 2009, has garnered nearly 20 citations and laid foundational tools for topological robotics. Beyond graph braid groups, Kurlin has made notable contributions to persistent homology and crystal structure analysis, developing methods to quantify and compare periodic patterns in materials. His research has been recognized for its originality in applying algebraic topology to real-world problems, from robot path planning to the automated discovery of new crystalline materials. Kurlin’s work exemplifies how abstract mathematical structures can drive practical innovation in computational science.