Lattices from tight frames and vertex transitive graphs (Q2325750): Difference between revisions
From MaRDI portal
Latest revision as of 13:00, 20 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lattices from tight frames and vertex transitive graphs |
scientific article |
Statements
Lattices from tight frames and vertex transitive graphs (English)
0 references
30 September 2019
0 references
The paper investigates relations between tight frames and vertex transitive graphs. A tight frame, also known as strongly eutactic configuration, is a set of vectors in Euclidean space such that the sum of the squares of the linear forms defined by these vectors is proportional to the Euclidean quadratic form. The paper starts by reproving two well known results: Theorem 1.1 saying that tight frames are rational (a more general result is for instance Proposition 1.8 in [\textit{J. Martinet} and \textit{B. Venkov}, in: Résaux euclidiens, designs sphériques et formes modulaires. Autour des travaux de Boris Venkov. Genève: L'Enseignement Mathé\-matique, 112--134 (2001; Zbl 1131.11344)]). The other result is Theorem 1.3 saying that orbits of irreducible groups are strongly eutactic, which can be found for instance as Theorem 3.6.6 in the textbook [\textit{J. Martinet}, Perfect lattices in Euclidean spaces. Berlin: Springer (2003; Zbl 1017.11031)]. Theorem 1.3 is applied to obtain strongly eutactic configurations from distance transitive graphs in Theorem 1.5. Examples are given of how to construct strongly eutactic configurations in root lattices and their duals from famous distance transitive graphs.
0 references
tight frames
0 references
strongly eutactic configurations
0 references
irreducible matrix groups
0 references
vertex transitive graphs
0 references
0 references