Related papers: The universal ${\mathfrak gl}$-weight system and t…
The quasisymmetric functions, $QSym$, are generalized for a finite alphabet $A$ by the colored quasisymmetric functions, $QSym_A$, in partially commutative variables. Their dual, $NSym_A$, generalizes the noncommutative symmetric functions,…
Quasi-triangular Hopf algebras were introduced by Drinfel'd in his construction of solutions to the Yang--Baxter Equation. This algebra is built upon $\mathcal{U}_h(\mathfrak{sl}_2)$, the quantized universal enveloping algebra of the Lie…
The orbital bivariate chromatic polynomial, introduced in this article, counts the number of ways to color the vertices of a graph with $\lambda$ colors such that adjacent vertices either receive distinct colors from a set of $\lambda$…
We calculate the continuous accumulation set ${\cal B}_q(p,\ell)$ of zeros of the chromatic polynomial $P(G^{(p,\ell)}_m,q)$ in the limit $m \to \infty$, on a family of graphs $G^{(p,\ell)}_m$ defined such that $G^{(p,\ell)}_m$ is obtained…
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…
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…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by…
A Carleman Weight Function (CWF) is used to construct a new cost functional for a Coefficient Inverse Problems for a hyperbolic PDE. Given a bounded set of an arbitrary size in a certain Sobolev space, one can choose the parameter of the…
For a finite Lie algebra $G_N$ of rank N, the Weyl orbits $W(\Lambda^{++})$ of strictly dominant weights $\Lambda^{++}$ contain $dimW(G_N)$ number of weights where $dimW(G_N)$ is the dimension of its Weyl group $W(G_N)$. For any…
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…
The Singer algebraic transfer is a fundamental homomorphism in algebraic topology, providing a bridge between the homology of classifying spaces and the cohomology of the Steenrod algebra $\mathcal{A}$, which forms the $E_2$-term of the…
DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been widely studied in recent years after its introduction by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an…
In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain first and second order differential equations for the orthogonal polynomials and associated functions with a weight on the unit circle. We…
For a given finite dimensional Hopf algebra $H$ we describe the set of all equivalence classes of cocycle deformations of $H$ as an affine variety, using methods of geometric invariant theory. We show how our results specialize to the…
Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized…
We introduce the Hopf algebra of uniform block permutations and show that it is self-dual, free, and cofree. These results are closely related to the fact that uniform block permutations form a factorizable inverse monoid. This Hopf algebra…
Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset induces a connected subgraph. Furthermore, if every other…
This is a study on pattern Hopf algebras in combinatorial structures. We introduce the notion of combinatorial presheaf, by adapting the algebraic framework of species to the study of substructures in combinatorics. Afterwards, we consider…
Using the standard filtration associated with a generalized lifting method, we determine all finite-dimensional Hopf algebras over an algebraically closed field of characteristic zero whose coradical generates a Hopf subalgebra isomorphic…