Proof of a conjecture of Fomichev and Karev

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Yan, Qi, Deng, Qingying, Jin, Xian'an
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914126821851136
author Yan, Qi
Deng, Qingying
Jin, Xian'an
author_facet Yan, Qi
Deng, Qingying
Jin, Xian'an
contents 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 $\mathfrak{sl}(2)$-weight system of its 2-dimensional irreducible representation.
format Preprint
id arxiv_https___arxiv_org_abs_2510_27279
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Proof of a conjecture of Fomichev and Karev
Yan, Qi
Deng, Qingying
Jin, Xian'an
Combinatorics
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 $\mathfrak{sl}(2)$-weight system of its 2-dimensional irreducible representation.
title Proof of a conjecture of Fomichev and Karev
topic Combinatorics
url https://arxiv.org/abs/2510.27279