A graph-theoretical classification for reflectable bases (Q2279511)

Take a root system \(\Delta\). One says that a subset \(X\subset \Delta\) is a reflectable base if it satisfies the following two properties: 1. \(X\) is linearly independent, 2. \(\Delta=ref(X)\), where \(ref(X)\) is a set of images of elements of \(X\) under a sequence of reflections around hyperplanes orthogonal to element of \(X\). In the paper under review the reflectable bases of root systems of types \(A\), \(B\) and \(D\). A graph-theoretical and a Dynkin-type characterization of reflectable bases is given for these root systems