The semilinear reducibility conjecture for zigzag graph completions
Let be the zigzag graph with loops, and let be its completion. The notation denotes the invariant over a finite field of cardinality .
Semilinear reducibility conjecture. For every , the graph is semilinearly reducible and, for every with no primes of bad reduction,
The conjecture concerns the same zigzag-completion assertion as the formula stated elsewhere in the paper: the formula is verified in the paper for , while the all- claim remains open.
References
Primary source
Dmitry Doryn, “On c_2 invariants of 4-regular Feynman graphs”, arXiv:1610.00668 (2016).
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
No solutions have been posted yet.