A "network of networks" (from history to algebra)
Abstract
Recall first the algebraic treatment of flows or tensions in a transportation network N, i.e. a connected antisymmetric 1-graph G(X, U). Assume that, unusually, we take the values of flows (resp. tensions) in C. So the algebraic lattices of flow (resp. tension) values associated to G(X, U) are lattices of C. These lattices are congruent modulo the action of the special linear group SL(2, C). Then, it is well known one can define a lattice function Gk(), as a modular function of weight 2k, on the set R of all lattices of C. Let now N1, N2, ..., Np be connected antisymmetric 1-graphs and Cn, the set of hermitian symmetric matrices n × n. Let also R' be the set of all the lattices of Cn. The previous structure can be transposed to any n × n symmetric hermitian matrices of flow (or tension) values of the Gi. In this case, the Siegel space Sn= Cn replaces the Poincar\'e half-plane, and the symplectic group Sp(2n, R) takes the place of the special linear group SL(2, C). We get now the new lattice function as a function of all the lattices of Sn, i.e. a model of the "network of networks" R'. In the end, we study the tree of minimal length of R'.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.