2017
DOI: 10.48550/arxiv.1710.00658
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The heptagon-wheel cocycle in the Kontsevich graph complex

Ricardo Buring,
Arthemy Kiselev,
Nina Rutten
Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
30
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 8 publications
(30 citation statements)
references
References 0 publications
0
30
0
Order By: Relevance
“…• k = 8: The only solution γ 7 consists of the heptagon-wheel and 45 other graphs (see Table 2, in which the coefficient of heptagon graph is 1 in bold, and [5]).…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…• k = 8: The only solution γ 7 consists of the heptagon-wheel and 45 other graphs (see Table 2, in which the coefficient of heptagon graph is 1 in bold, and [5]).…”
Section: Resultsmentioning
confidence: 99%
“…Finally, we find a heptagon-wheel eight-vertex graph which, after the orientation of its edges, gives a new universal Kontsevich flow. We refer to [8,9] for motivations, to [2,4] for an exposition of basic theory, and to [6] and [5] for more details about the pentagonwheel (5+1)-vertex and heptagon-wheel (7+1)-vertex solutions respectively. Let us remark that all the algorithms outlined here can be used without modification in the course of constructing all k-vertex Kontsevich graph solutions with higher k 5 in the deformation problem under study.Basic concept.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…Examples of this construction for known graph cocycles γ 2ℓ+1 on n vertices and 2n − 2 edges (namely, n = 2ℓ + 2 = 4, 6, and 8) have been given in [2,3], [7], and [4], respectively. Practical calculation of graph cocycles is addressed in [8,30]; the algorithms to verify the Poisson cocycle factorisation through the Jacobi identity are available from [9]. In the fundamental work [29], see also [27], Willwacher related the unoriented graph complex to generators of the Grothendieck-Teichmüller Lie algebra grt.…”
mentioning
confidence: 99%
“…Are the graph cocycles truly graphs ? In the papers [21] (see also [22] and [4,8,28] for a pedagogical review), Kontsevich introduced the graph complex -one of the many -with parity-even vertices, with a wedge ordering of parity-odd edges, and the differential d = [•−•, •] produced by the graded commutator of graph insertions into vertices. This direction of research was furthered by Willwacher et al [11,14,29]: in particular, in [30] a generating function counts the numbers of nonzero (i.e.…”
mentioning
confidence: 99%