Proof of a conjecture of Fomichev and Karev

2025/10/31 by Yan, Qi, Deng, Qingying, Jin, Xian'an · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2510.27279

Abstract

We prove a conjecture of Fomichev and Karev [European J. Combin. 127 (2025) 104160] by showing the equality of two graph invariants: φ, defined via graph colorings, and ψ, derived from the \mathfraksl(2)-weight system of its 2-dimensional irreducible representation.

Citations

• The sl(2)-weight system at c = 3/8 for graphs

Cited by

• \mathfraksl(2)-weight system does not extend to a graph 4-invariant

Related

• \mathfraksl(2)-weight system does not extend to a graph 4-invariant
• Chromatic weight systems and the corresponding knot invariants
• The sl(2)-weight system at c = 3/8 for graphs
• Duality for the \mathfraksl₂ weight system
• Weight systems and invariants of graphs and embedded graphs