Logarithmic Frobenius structures and Coxeter discriminants (Q881961): Difference between revisions

The values of decomposable forms are studied and the locally divergent orbits are described in terms of minimal parabolic \(K\)-algebras. One considers a reductive algebraic group \(G\) defined over a number field \(K\). In addition, one denotes by \(S\) a finite set of valuations of \(K\) containing all Archimedean ones, and by \(\Gamma \) an \(S\)-arithmetic subgroup of \(G\). It is proven that, if the collection of decomposable homogeneous forms \(f_{v}\in K_{v}[x_{1},\dots, x_{n}]\), \(v\in S\) takes discrete values at \(O^{n},\) where \(O\) is the ring \(S\) of integers of \(K\), then there exists a homogeneous form \(g\in O[x_{1},\dots,x_{n}],\) such that \(\;f_{v}=\alpha _{v}g,\alpha _{v}\in K_{v}^{\ast }\), for all \(v\in S\). It is emphasized that the result applies to the simplest case of an real homogeneous form when \(K=\mathbb Q\) and \(O=\mathbb Z\). A class of solutions for the so called WDVV equation is studied in relation to the special systems of convertors (V-systems). The restrictions of the Coxeter root systems to the mirror hyperplanes (and, in general, to any their intersections) are investigated within the general theory of hyperplanes arrangements. It is shown that the corresponding complements admit a natural logarithmic Frobenius structure dual, in Dubrovin's sense, to the Strachan's structures on the strata of the Coxeter discriminants. Also, it is proven that, for the classical Coxeter root systems, this leads to the families of V-systems. A complete list of corresponding V-systems is given for the case of the exceptional Coxeter root systems. The authors obtain also some new families of V-systems which cannot be obtained from the Coxeter root systems. It is suggested that a complete classification of the V-systems still remains one of the most important open problems. The relations of V-systems with the Seiberg-Witten theory is considered also as another important problem for future research.