Related papers: The universal ${\mathfrak gl}$-weight system and t…
Cho and van Willigenburg (arXiv:1508.07670) and Alinaeifard, Wang, and van Willgenburg (arXiv:2010.00147) introduce multiplicative chromatic bases for the ring $\Lambda$ of symmetric functions, consisting of the chromatic symmetric…
Using the formalism of species and twisted objects, we introduce two structures of cointeracting bialgebras on hypergraphs, induced by two notions of induced sub-hypergraphs. We study the associated unique morphisms of cointeracting…
We define some new algebraic structures, termed coloured Hopf algebras, by combining the coalgebra structures and antipodes of a standard Hopf algebra set $\cal H$, corresponding to some parameter set $\cal Q$, with the transformations of…
We present a novel symmetry of the colored HOMFLY polynomial. It relates pairs of polynomials colored by different representations at specific values of $N$ and generalizes the previously known "tug-the-hook" symmetry of the colored…
Let ${\cal L}$ be a variation of Hodge structures on the complement $X^{*}$ of a normal crossing divisor (NCD) $ Y$ in a smooth analytic variety $X$ and let $ j: X^{*} = X - Y \to X $ denotes the open embedding. The purpose of this paper is…
The goal of this paper is to show that valuation theory and Hopf theory are compatible on the class of generalized permutahedra. We prove that the Hopf structure $\mathbf{GP}^+$ on these polyhedra descends, modulo the inclusion-exclusion…
We introduce a coloured generalization $\mathrm{NSym}_A$ of the Hopf algebra of non-commutative symmetric functions described as a subalgebra of the of rooted ordered coloured trees Hopf algebra. Its natural basis can be identified with the…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
Polar codes can be viewed as decreasing monomial codes, revealing a rich algebraic structure governed by the lower-triangular affine (LTA) group. We develop a general framework to compute the Hamming weight of codewords generated by sums of…
The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colorings of $G$. The list color function of graph $G$, denoted $P_{\ell}(G,m)$, is a list analogue of the chromatic polynomial that has been…
In this paper hypergraph Lambek calculus ($\mathrm{HL}$) is presented. This formalism aims to generalize the Lambek calculus ($\mathrm{L}$) to hypergraphs as hyperedge replacement grammars extend context-free grammars. In contrast to the…
In this paper, we introduce the concept of the weighted (harmonic) chromatic polynomials of graphs and discuss some of its properties. We also present the notion of the weighted (harmonic) Tutte--Grothendieck polynomials of graphs and give…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
We show that Hopf invariants, defined by evaluation in Harrison cohomology of the commutative cochains of a space, calculate the logarithm map from a fundamental group to its Malcev Lie algebra. They thus present the zeroth Harrison…
In this paper we construct a new basis for the cyclotomic completion of the center of the quantum $\mathfrak{gl}_N$ in terms of the interpolation Macdonald polynomials. Then we use a result of Okounkov to provide a dual basis with respect…
In this paper, we propose an algebraic approach to determine whether two non-isomorphic caterpillar trees can have the same symmetric function generalization of the chromatic polynomial. On the set of all composition on integers, we…
Quite recently, a ``coloured'' extension of the Yang-Baxter equation has appeared in the literature and various solutions of it have been proposed. In the present contribution, we introduce a generalization of Hopf algebras, to be referred…
We introduce a new series $R_k$, $k=2,3,4,\dots$, of integer valued weight systems. The value of the weight system $R_k$ on a chord diagram is a signed number of cycles of even length $2k$ in the intersection graph of the diagram. We show…
We explore several generalizations of Whitney's theorem -- a classical formula for the chromatic polynomial of a graph. Following Stanley, we replace the chromatic polynomial by the chromatic symmetric function. Following Dohmen and Trinks,…
The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…