The refined weight-mixing conjecture for graphs
The refined weight-mixing conjecture for graphs
Let be a primitive log-divergent graph with loop number and . Suppose is mixed Tate. Refined weight-mixing conjecture. Either has pure weight , or its weights include some weights between and .
The source says that the known data is consistent with this sharper alternative, while noting that the analogous statement is false for non- graphs. It remains open.
Sources & referencesView supporting material
Primary source
Erik Panzer and Oliver Schnetz, “The Galois coaction on ϕ^4 periods”, arXiv:1603.04289 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.