Search arXivSearch

arXiv · 1811.10638

The defining properties of the Kontsevich unoriented graph complex

Abstract

Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $γ$ be endowed with an ordered set of edges $\mathsf{E}(γ)$. Denote by Gra the vector space of formal sums of graphs modulo the relation $(γ_1,\mathsf{E}(γ_1))-\text{sign}(σ) (γ_2,\mathsf{E}(γ_2)) = 0$ for topologically equal graphs $γ_1$ and $γ_2$ whose edge orderings differ by a permutation $σ$. The zero class in Gra is represented by sums of graphs that cancel via the above relation. The Lie bracket of graphs with ordered edge sets is defined using the insertion of a graph into vertices of the other one. We give an explicit proof of the theorems which state that the space Gra is a well\/-\/defined differential graded Lie algebra: both the Lie bracket $[{\cdot},{\cdot}]$ and the vertex\/-\/expanding differential ${\mathrm d}=[{\bullet}\!{-}\!{\bullet},{\cdot}]$ respect the calculus modulo zero graphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nina J. Rutten, Arthemy V. Kiselev. 2018-11-26. The defining properties of the Kontsevich unoriented graph complex. https://doi.org/10.1088/1742-6596%2F1194%2F1%2F012095

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO