Otakar Borůvka

Otakar Borůvka (10 May 1899 in Uherský Ostroh – 22 July 1995 in Brno) was a Czech mathematician best known today for his work in graph theory, long before this was an established mathematical discipline.[1][2]

Education and career

Borůvka was born in Uherský Ostroh, a town in Moravia (then in Austria-Hungary, later Czechoslovakia; today Czech Republic), the son of a school headmaster.[2] He attended the grammar school in Uherské Hradiště beginning in 1910.[1] In 1916, influenced by the ongoing World War I, he moved to the military school (Realschule) in Hranice, and later he enrolled into the military technical academy in Mödling near Vienna.[1][2]

When the war ended, Borůvka returned to Uherské Hradiště, finished his studies in 1918 at the Gymnasium there, and became a student at the Imperial Czech Technical University of Franz Joseph, in Brno, initially studying civil engineering.[1][2] In 1920, Masaryk University opened in Brno, and Borůvka also began taking courses there.[1] He became an assistant to Mathias Lerch at Masaryk in 1921, but Lerch died in 1922; his position at Masaryk was taken by Eduard Čech, whom Borůvka also assisted, earning his doctorate in 1923.[3]

At Čech's suggestion, Borůvka visited Élie Cartan in Paris from 1926 to 1927.[1][2] He earned his habilitation from Masaryk University in 1927, and (turning down an offer from the University of Zagreb) he became a docent there in 1928.[1][2] He continued to travel abroad through the late 1920s and early 1930s, to Cartan in Paris again as well as to Wilhelm Blaschke in Hamburg.[1][2] He was promoted to assistant professor at Masaryk in 1934, given a chair in 1940, and made an ordinary professor in 1946.[1][2]

In 1965, he founded the new journal Archivum Mathematicum, and in 1969, he became a founding member of the Institute of Mathematics of the Czechoslovak Academy of Sciences, splitting his time between the Institute and his professorship at Masaryk.[2]

Contributions

The problem of designing efficient electric distribution networks had been suggested to Borůvka by his friend Jindřich Saxel, an employee of an electrical utility, during World War I. In his 1926 paper O jistém problému minimálním (English On a certain minimal problem),[4] Borůvka solved this problem by modeling it mathematically as a minimum spanning tree problem, and described the first known algorithm for finding the minimum spanning tree of a metric space (the set of cities to be connected by the network, together with their distances).[1] Now called Borůvka's algorithm, his method works by repeatedly adding a connections between each subtree of the minimum spanning tree found so far and its nearest neighboring subtree.[5] The same algorithm has been rediscovered repeatedly.[6][7][8] It is more suitable for distributed and parallel computation than many other minimum spanning tree algorithms, can achieve linear time complexity on planar graphs and more generally in minor-closed graph families,[9] and plays a central role in the randomized linear time algorithm of Karger, Klein & Tarjan (1995).[10]

From 1924 to 1935, Borůvka's primary interest was in differential geometry. His work in this area concerned analytic correspondences between projective planes, normal curvature of high-dimensional surfaces, and Frenet formula for curves in high-dimensional spaces.[2]

Beginning in the 1930s, Borůvka's interests shifted to abstract algebra, and in particular the theory of groups. He was also one of the first to study a generalization of groups, called by him "groupoids" but now more commonly referred to as magmas.[2] A textbook by him on groups and groupoids, originally published in Czech in 1944, went through several expansions, and translations, including an English edition in 1976.[1]

Following the war, Borůvka shifted gears again, from algebra to the theory of differential equations. He published several research papers on this subject, as well as a monograph on second-order differential equations which he published in 1971.[1]

Awards and honors

Borůvka became a corresponding member of the Czechoslovak Academy of Sciences at its creation in 1953, and an ordinary member in 1965. In 1969, Comenius University in Bratislava gave him an honorary doctorate, and in 1994 he received a second honorary doctorate from Masaryk University in Brno.[1][11]

He has also been given medals by the Free University of Brussels, the University of Liège, Jagiellonian University, Comenius University, Palacký University of Olomouc, Jan Evangelista Purkyně University in Ústí nad Labem, the German Academy of Sciences at Berlin, the Russian Academy of Sciences#Academy of Sciences of the USSR, and the Czechoslovak Academy of Sciences.[12]

References

  1. 1 2 3 4 5 6 7 8 9 10 11 12 13 O'Connor, John J.; Robertson, Edmund F., "Otakar Borůvka", MacTutor History of Mathematics archive, University of St Andrews.
  2. 1 2 3 4 5 6 7 8 9 10 11 Třešňák, Zdeněk; Šarmanová, Petra; Půža, Bedřich (1996), Třešňák, Zdeněk; Šarmanová, Petra; Půža, Bedřich, eds., Otakar Borůvka [English resume], Brno: Nadace Universitas Masarykiana v Brně, pp. 218–222.
  3. ↑ This date is from MacTutor. A later date, 1926, is given by Otakar Borůvka at the Mathematics Genealogy Project. However, this appears to refer to his habilitation rather than his doctorate.
  4. ↑ Borůvka, Otakar (1926), "O jistém problému minimálním", Práce Moravské přírodovědecké společnosti, 3 (3): 37–58
  5. ↑ Nešetřil, Jaroslav; Milková, Eva; Nešetřilová, Helena (2001), "Otakar Borůvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history", Discrete Mathematics, 233 (1–3): 3–36, doi:10.1016/S0012-365X(00)00224-7, MR 1825599
  6. ↑ Choquet, Gustave (1938), "Étude de certains réseaux de routes", Comptes-rendus de l’Académie des Sciences (in French), 206: 310–313
  7. ↑ Florek, Kazimierz (1951), "Sur la liaison et la division des points d'un ensemble fini", Colloquium Mathematicum (in French), 2: 282–285
  8. ↑ Sollin, M. (1965), "Le tracé de canalisation", Programming, Games, and Transportation Networks (in French)
  9. ↑ Eppstein, David (1999), "Spanning trees and spanners", in Sack, J.-R.; Urrutia, J., Handbook of Computational Geometry, Elsevier, pp. 425–461; Mareš, Martin (2004), "Two linear time algorithms for MST on minor closed graph classes" (PDF), Archivum Mathematicum, 40 (3): 315–320.
  10. ↑ Karger, David R.; Klein, Philip N.; Tarjan, Robert E. (1995), "A randomized linear-time algorithm to find minimum spanning trees", Journal of the Association for Computing Machinery, 42 (2): 321–328, doi:10.1145/201019.201022, MR 1409738
  11. ↑ "Otakar Borůvka", Masaryk University in Brno
  12. ↑ Neuman, František (1979), "The eightieth birthday of Academician Otakar Borůvka", Czechoslovak Mathematical Journal, 29 (2): 330–335, MR 529522, Zbl 0397.01006.

External links

This article is issued from Wikipedia - version of the 10/18/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.