Related papers: Topological Graph Polynomials in Colored Group Fie…

This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…

We define a new topological polynomial extending the Bollobas-Riordan one, which obeys a four-term reduction relation of the deletion/contraction type and has a natural behavior under partial duality. This allows to write down a completely…

This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Recently, big data techniques such as machine learning and topological data analysis have made their way to theoretical mathematics. Motivated by the recent work with polynomial invariants for knots, we use manifold learning and topological…

The Tutte polynomial is a generalization of the chromatic polynomial of graph colorings. Here we present an extension called the rooted Tutte polynomial, which is defined on a graph where one or more vertices are colored with prescribed…

Let $\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\ell:E(G)\rightarrow \Gamma$, there exists a vertex coloring $c$ by the…

In this paper, we will study the chromatic number of Cayley graphs of algebraic groups that arise from algebraic constructions. Using Lang-Weil bound and representation theory of finite simple groups of Lie type, we will establish lower…

I discuss the general formalism of two-dimensional topological field theories defined on open-closed oriented Riemann surfaces, starting from an extension of Segal's geometric axioms. Exploiting the topological sewing constraints allows for…

We present closed graph and open mapping theorems for $\wt{\C}$-linear maps acting between suitable classes of topological and locally convex topological $\wt{\C}$-modules. This is done by adaptation of De Wilde's theory of webbed spaces…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…

The bivariate chromatic polynomial $\chi_G(x,y)$ of a graph $G = (V, E)$, introduced by Dohmen-P\"{o}nitz-Tittmann (2003), counts all $x$-colorings of $G$ such that adjacent vertices get different colors if they are $\le y$. We extend this…

Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…

Topological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs, which generalize many…

We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…

We describe how to construct a spanning set of linearly-independent, automatically orthogonal colour tensors for scattering amplitudes involving coloured particles transforming under arbitrary representations of any gauge theory, sufficient…

We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…

Following our previous works on $C^*$-graph algebras and the associated Cuntz-Krieger graph families, in this paper we will try to have a look at the colored version of these structures and to see what a $C^*$-colored graph algebra might…

This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…