English
Related papers

Related papers: Polynomial graph invariants and the KP hierarchy

200 papers

Jaeger et al. in 1992 introduced group coloring as the dual concept to group connectivity in graphs. Let $A$ be an additive Abelian group, $ f: E(G)\to A$ and $D$ an orientation of a graph $G$. A vertex coloring $c:V(G)\to A$ is an $(A,…

Combinatorics · Mathematics 2026-01-23 Houshan Fu

The aim of this paper is two-fold. First, we give a fully geometric description of the HOMFLYPT homology of Khovanov-Rozansky. Our method is to construct this invariant in terms of the cohomology of various sheaves on certain algebraic…

Geometric Topology · Mathematics 2017-11-15 Ben Webster , Geordie Williamson

The Kadomtsev-Petviashvili (KP) equation is the cornerstone of integrable systems, whose solutions reflect deep connections in algebraic geometry. Banana curves are reducible rational curves obtained as a degeneration of hyperelliptic…

Algebraic Geometry · Mathematics 2025-12-16 Simonetta Abenda , Türkü Özlüm Çelik , Claudia Fevola , Yelena Mandelshtam

In arXiv:1709.07504 Ardila and Aguiar give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…

Combinatorics · Mathematics 2021-07-09 Jean-Christophe Aval , Théo Karaboghossian , Adrian Tanasa

We compute an explicit formula for the antipode of the double bialgebra of graphs in terms of totally acyclic partial orientations, using some general results on double bialgebras. In analogy to what was already proven in Hopf-algebraic…

Combinatorics · Mathematics 2024-04-09 Loïc Foissy , Claudia Malvenuto

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

Computational Complexity · Computer Science 2008-05-19 Jarek Duda

We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…

Combinatorics · Mathematics 2018-07-11 G. Arunkumar , Deniz Kus , R. Venkatesh

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

Combinatorics · Mathematics 2015-03-17 R. Askanazi , S. Chmutov , C. Estill , J. Michel , P. Stollenwerk

We construct knot invariants from solutions to the Yang--Baxter equation associated to appropriately generalized left/right Yetter--Drinfel'd modules over a braided Hopf algebra with an automorphism. When applied to Nichols algebras, our…

Geometric Topology · Mathematics 2024-04-24 Stavros Garoufalidis , Rinat Kashaev

This article approaches the counting of subgraphs, in terms of signature-type functionals defined over combinatorial Hopf algebras of graphs. Well-known algebraic identities that arise in the context of counting subgraphs are then captured…

Rings and Algebras · Mathematics 2025-03-27 Diego Caudillo , Joscha Diehl , Kurusch Ebrahimi-Fard , Emanuele Verri

Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…

Combinatorics · Mathematics 2020-02-06 Olivier Bernardi , Philippe Nadeau

We introduce a natural Hopf algebra structure on the space of noncommutative symmetric functions which was recently studied as a vector space by Rosas and Sagan. The bases for this algebra are indexed by set partitions. We show that there…

Combinatorics · Mathematics 2016-11-08 Nantel Bergeron , Christophe Reutenauer , Mercedes Rosas , Mike Zabrocki

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

Combinatorics · Mathematics 2022-12-16 Chris Godsil , Krystal Guo , Gordon Royle

We give a graph-sum algorithm that expresses any genus-$g$ Gromov-Witten invariant of the symmetric product orbifold $\mathrm{Sym}^d\mathbb{P}^r:=[(\mathbb{P}^r)^d/S_d]$ in terms of "Hurwitz-Hodge integrals" -- integrals over (compactified)…

Algebraic Geometry · Mathematics 2023-03-14 Robert Silversmith

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

Combinatorics · Mathematics 2012-03-12 Brandon Humpert , Jeremy L. Martin

A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…

Combinatorics · Mathematics 2018-07-20 Joanna A. Ellis-Monaghan , Louis H. Kauffman , Iain Moffatt

In this paper we introduce new various generalizations of the classical Kadomtsev-Petviashvili hierarchy in the case of operators in several variables. These generalizations are the candidates for systems that should play the role,…

Mathematical Physics · Physics 2007-05-23 Alexander Zheglov

We investigate when a skew polynomial extension T = R[x; {\sigma}, {\delta}] of a Hopf algebra R admits a Hopf algebra structure, substantially generalising a theorem of Panov. When this construction is applied iteratively in characteristic…

Rings and Algebras · Mathematics 2014-08-06 K. A. Brown , S. O'Hagan , J. J. Zhang , G. Zhuang

Let $G$ be a simple graph and let $\mathcal{L}(G)$ be the free partially commutative Lie algebra associated to $G$. In this paper, using heaps of pieces, we prove an expression for the generalized $\textbf k$-chromatic polynomial of $G$ in…

Combinatorics · Mathematics 2019-07-23 G Arunkumar

Standard combinatorial construction, due to Kontsevich, associates to any $\ai$-algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We propose an…

Algebraic Topology · Mathematics 2008-01-08 Alastair Hamilton , Andrey Lazarev