The concept of cutting vectors for vector systems in the Euclidean plane (Q1972379)

A finite collection of at least two unit vectors in the Euclidean plane is called a vector system. Let \(V\) be such a vector system. For each element \(v \in V\) we determine the cardinality \(k_v\) of the set of vectors in \(V\) having an angle strictly between \(0\) and \(\pi\) with \(v\). By assigning these cardinalities to all \(v \in V\), we get for every vector system a uniquely determined vector (with entries \(k_v\)). This vector is called the cutting vector of \(V\) and characterizes the combinatorial structure of the vector system up to cyclic permutations. In this paper a full characterization of those vectors which are realizable as cutting vectors is given. Moreover, it is shown under which conditions we can find a transformation which starts and ends with two given cutting vectors and which only uses cutting vectors as intermediate steps. The concept of cutting vectors can, for example, be used to derive results on the total weight of arrangements.