Austrian American mathematician
Brigitte Irma Servatius (born 1954)[1] is a mathematician specializing in matroids and structural rigidity. She is a professor of mathematics at Worcester Polytechnic Institute,[2] and has been the editor-in-chief of the Pi Mu Epsilon Journal since 1999.[3]
Education and career
Servatius is originally from Graz in Austria.[4]
As a student at an all-girl gymnasium in Graz that specialized in language studies rather than mathematics, her interest in mathematics was sparked by her participation in a national mathematical olympiad,[2]
and she went on to earn master's degrees in mathematics and physics at the University of Graz.[3]
She became a high school mathematics and science teacher in Leibnitz. [4] She moved to the US in 1981, to begin doctoral studies at Syracuse University.[2] She completed her Ph.D. in 1987,[5] and joined the Worcester Polytechnic Institute [4] faculty in the same year.[2] Her dissertation, Planar Rigidity, was supervised by Jack Graver.[5]
Contributions
While still in Austria, Servatius began working on combinatorial group theory, and her first publication (appearing while she was a graduate student) is in that subject.[2][Z]
She switched to the theory of structural rigidity for her doctoral research,
and later became the author (with Jack Graver and Herman Servatius) of the book Combinatorial Rigidity (1993).[6][G]
Another well-cited paper of hers in this area characterizes the planar Laman graphs, the minimally rigid graphs that can be embedded without crossings in the plane, as the graphs of pseudotriangulations, partitions of a plane region into subregions with three convex corners studied in computational geometry.[H]
Servatius is also the co-editor of a book on matroid theory.[B]
With Tomaž Pisanski she wrote the book Configurations from a Graphical Viewpoint (2013), on configurations of points and lines in the plane with the same number of points touching each two lines and the same number of lines touching each two points.[7][P] Other topics in her research include graph duality[S] and the triconnected components of infinite graphs.[D]
