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

Generalized permutahedra are a family of polytopes with a rich combinatorial structure and strong connections to optimization. We prove that they are the universal family of polyhedra with a certain Hopf algebraic structure. Their antipode…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

The symplectic derivation Lie algebras defined by Kontsevich are related to various geometric objects including moduli spaces of graphs and of Riemann surfaces, graph homologies, Hamiltonian vector fields, etc. Each of them and its…

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,…

We propose to study a generalization of the Klebanov-Polyakov-Witten (KPW) construction for the algebra of observables in the $c = 1$ string model to theories with $c > 1$. We emphasize the algebraic meaning of the KPW construction for $c =…

We give a combinatorial characterization of Fulton's operational Chow cohomology groups of a complete , $\Q$-factorial, rational T-variety of complexity one in terms of so called generalized Minkowsky weights in the contraction-free case.…

Let $G = (V,E)$ be a graph, and for each $e \in E(G)$, let $L_e$ be a list of real numbers. Let $w:E(G) \to \cup_{e \in E(G)}L_e$ be an edge weighting function such that $w(e) \in L_e$ for each $e \in E(G)$, and let $c_w$ be the vertex…

The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…

We prove that the generating function for the symmetric chromatic polynomial of all connected graphs satisfies (after appropriate scaling change of variables) the Kadomtsev--Petviashvili integrable hierarchy of mathematical physics.…

Hamiltonians ${\cal H}^{a}_k$ of new integrable systems associated with the integer rays $(1,a)$ (commutative subalgebras) of Ding-Iohara-Miki (DIM) algebra in the $N$-body representation are closely related to commuting twisted Cherednik…

We generalise gauge theory on a graph so that the gauge group becomes a finite-dimensional ribbon Hopf algebra, the graph becomes a ribbon graph, and gauge-theoretic concepts such as connections, gauge transformations and observables are…

A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…

We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…

In the last decennia two generalizations of the Hopf algebra of symmetric functions have appeared and shown themselves important, the Hopf algebra of noncommutative symmetric functions NSymm and the Hopf algebra of quasisymmetric functions…

Let us fix a positive integer $\nu>1$. For each positive integer $n>1$, we consider a normal supercharacter theory $\mathcal{S}_n$ of $G_n$, where $G_n$ is the direct-product of $n-1$ copies of the cyclic group of order $\nu$. Then we endow…

An edge-weighted graph $G$, possibly with loops, is said to be antiferromagnetic if it has nonnegative weights and at most one positive eigenvalue, counting multiplicities. The number of graph homomorphisms from a graph $H$ to an…

This manuscript introduces a finite collection of generalized permutohedra associated to a simple graph. The first polytope of this collection is the graphical zonotope of the graph and the last is the graph-associahedron associated to it.…

The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…

For a hypergraphic polytope there is a weighted quasisymmetric function which enumerates positive integer points in its normal fan and determines its f-polynomial. This quasisymmetric function invariant of hypergraphs extends the Stanley…

Let $(X,\nu,T)$ be a measure-preserving system, and let $P_1,\ldots, P_k$ be polynomials with integer coefficients. We prove that, for any $f_1,\ldots, f_k\in L^{\infty}(X)$, the M\"obius-weighted polynomial multiple ergodic averages…