Related papers: The universal ${\mathfrak gl}$-weight system and t…

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.

Let G be a smooth group scheme over $F_p$ equipped with a $G_m$-action such that all weights of $G_m$ on the Lie algebra of G are not greater than 1. Let $Disp_n^G$ be Eike Lau's stack of n-truncated G-displays (this is an algebraic stack…

The aim of the paper is to study relations between polynomial solutions of generalized Moisil-Theodoresco (GMT) systems and polynomial solutions of Hodge-de Rham systems and, using these relations, to describe polynomial solutions of GMT…

In a seminal paper, Alon and Tarsi have introduced an algebraic technique for proving upper bounds on the choice number of graphs (and thus, in particular, upper bounds on their chromatic number). The upper bound on the choice number of $G$…

In this paper we construct two infinite sets of self-adjoint commuting charges for a quite general CFT. They come out naturally by considering an infinite embedding chain of Lie algebras, an underlying structure that share all theories with…

Let $G$ be a connected graph and let $\mathbb{X}$ be the set of projective points defined by the column vectors of the incidence matrix of $G$ over a field $K$ of any characteristic. We determine the generalized Hamming weights of the…

This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…

In this paper we consider the problem of determining the weight spectrum of q-ary codes C(3,m) associated with Grassmann varieties G(3,m). For m=6 this was done by Nogin. We derive a formula for the weight of a codeword of C(3,m), in terms…

DP-coloring is a generalization of list coloring that was introduced in 2015 by Dvo\v{r}\'{a}k and Postle. The chromatic polynomial of a graph is a notion that has been extensively studied since the early 20th century. The chromatic…

Let $G$ be a compact semisimple Lie group and $T$ be a maximal torus of $G$. We describe a method for weight multiplicity computation in unitary irreducible representations of $G$, based on the theory of Berezin quantization on $G/T$. Let…

In [J. Combin. Theory Ser. B 161 (2023), 109--119], the authors showed that the list-color function $P_l(G,k)$ of any simple graph $G$ of size $m$ coincides with its chromatic polynomial $P(G,k)$ for all integers $k\ge m-1$. In this…

After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the…

We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…

We describe a bigraded cocommutative Hopf algebra structure on the weight zero compactly supported rational cohomology of the moduli space of principally polarized abelian varieties. By relating the primitives for the coproduct to graph…

We associate to a multiple polylogarithm a holomorphic 1-form on the universal abelian cover of its domain. We relate the 1-forms to the symbol and variation matrix and show that the 1-forms naturally define a lift of the variation of mixed…

The computation of Feynman integrals in massive higher order perturbative calculations in renormalizable Quantum Field Theories requires extensions of multiply nested harmonic sums, which can be generated as real representations by Mellin…

In the present paper, we provide results that relate the Jacobi polynomials in genus $g$. We show that if a code is $t$-homogeneous that is, the codewords of the code for every given weight hold a $t$-design, then its Jacobi polynomial in…

DP-coloring (also called correspondence coloring) is a generalization of list coloring that was introduced by Dvo\v{r}\'{a}k and Postle in 2015. The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was…

We prove that the partial-dual genus polynomial considered as a function on chord diagrams satisfies the four-term relation. Thus it is a weight system from the theory of Vassiliev knot invariants.

In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…