Related papers: Polynomial Invariants for Arbitrary Rank $D$ Weakl…
We define additional gradings on two generalisations of Khovanov homology (one due to the first author, the other due to the second), and use them to define invariants of various kinds of embeddings. These include invariants of links in…
Binomial Eulerian polynomials first appeared in work of Postnikov, Reiner and Williams on the face enumeration of generalized permutohedra. They are $\gamma$-positive (in particular, palindromic and unimodal) polynomials which can be…
Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…
For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…
For each 3-dimensional non-Lie Leibniz algebra over the complex numbers, we describe the algebra of polynomial invariants and determine its group of automorphisms. As a consequence, we establish that any two non-nilpotent 3-dimensional…
We explain a correspondence between some invariants in the dynamics of color exchange in a 2d coloring problem, which are polynomials of winding numbers, and linking numbers in 3d. One invariant is visualized as linking of lines on a…
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…
The binomial Eulerian polynomials, introduced by Postnikov, Reiner, and Williams, are $\gamma$-positive polynomials and can be interpreted as $h$-polynomials of certain flag simplicial polytopes. Recently, Athanasiadis studied analogs of…
We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…
This article introduces a natural extension of colouring numbers of knots, called colouring polynomials, and studies their relationship to Yang-Baxter invariants and quandle 2-cocycle invariants. For a knot K in the 3-sphere let \pi_K be…
Several classical knot invariants, such as the Alexander polynomial, the Levine-Tristram signature and the Blanchfield pairing, admit natural extensions from knots to links, and more generally, from oriented links to so-called colored…
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…
In this paper, we show that for every graph of maximum average degree bounded away from $d$, any $(d+1)$-coloring can be transformed into any other one within a polynomial number of vertex recolorings so that, at each step, the current…
We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan…
It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of…
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$.…
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
A graph is $k$-degenerate if every subgraph $H$ has a vertex $v$ with $d_{H}(v) \leq k$. The class of degenerate graphs plays an important role in the graph coloring theory. Observed that every $k$-degenerate graph is $(k + 1)$-choosable…
This expository monograph cuts a short path from the common, elementary background in geometry (linear algebra, vector bundles, and algebraic ideals) to the most advanced theorems about involutive exterior differential systems: (1) The…