Related papers: M-Polynomial of Product Graphs
Let M be the product of two compact Hamiltonian T-spaces X and Y. We present a formula for evaluating integrals on the symplectic reduction of M by the diagonal T action. At every regular value of the moment map for X x Y, the integral is…
In this note, we give a simple closed formula for an arbitrary product, landing in dimension 0, of boundary classes on the Deligne--Mumford moduli space M_0,n-bar. For any such boundary strata $X_{T_1}, \ldots, X_{T_\ell}$, we show the…
Let K be the product O(n_1) x O(n_2) x ... x O(n_r) of orthogonal groups. Let V the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for the dimension of the K-invariant algebra of…
How to utilize deep learning methods for graph classification tasks has attracted considerable research attention in the past few years. Regarding graph classification tasks, the graphs to be classified may have various graph sizes (i.e.,…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…
We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…
A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We consider a scalar-valued implicit function of many variables, and provide two closed formulae for all of its partial derivatives. One formula is based on products of partial derivatives of the defining function, the other one involves…
In this paper we are defining a special class of graphs called multilayered graphs and its subclass, multilayered cycles. For that subclass of graphs we are giving the values of all vertex spans (strong, direct, or Cartesian span).…
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,…
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…
We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width $w$, we give an $n^{\mathcal{O}(w)}$-time…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…
A dot-product representation of a graph is a mapping of its vertices to vectors of length $k$ so that vertices are adjacent if and only if the inner product (a.k.a. dot product) of their corresponding vertices exceeds some threshold.…
Multi-degree splines are smooth piecewise-polynomial functions where the pieces can have different degrees. We describe a simple algorithmic construction of a set of basis functions for the space of multi-degree splines, with similar…
We define a product of pairs of double complex spaces $C^n_m(V, \mathcal{W}, \mathcal{F})$ for gradig-restricted vertex algebra cohomology of codimension one foliation on a complex curve. We introduce a vertex algebra counterpart of the…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…