2-regular Digraphs of the Lovelock Lagrangian
Abstract
The manuscripts tabulates arc lists of the 1, 1, 3, 8, 25, 85, 397 ... unlabeled 2-regular digraphs on n=0, 1, 2, ..., 9 nodes, including disconnected graphs, graphs with multiarcs and/or graphs with loops. Each of these graphs represents one term of the Lagrangian of Lovelock's type -- a contraction of a product of n Riemann tensors -- once the 2 covariant and 2 contravariant indices of a tensor are associated with the in-edges and out-edges of a node.
0
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.