Related papers: A categorification for the partial-dual genus poly…
Given a graph $G$, its genus polynomial is $\Gamma_G(x) = \sum_{k\geq 0} g_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture…
We give an excluded minor characterisation of the class of ribbon graphs that admit partial duals of Euler genus at most one.
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
Partial cubes are the graphs which can be embedded into hypercubes. The {\em cube polynomial} of a graph $G$ is a counting polynomial of induced hypercubes of $G$, which is defined as $C(G,x):=\sum_{i\geqslant 0}\alpha_i(G)x^i$, where…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…
We give a classification of all quasitriangular structures and ribbon elements of $\mathcal{D}(G)$ explicitly in terms of group homomorphisms and central subgroups. This can equivalently be interpreted as an explicit description of all…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
Double Hurwitz numbers have at least four equivalent definitions. Most naturally, they count covers of the Riemann sphere by genus g curves with certain specified ramification data. This is classically equivalent to counting certain…
We show that the only orthogonal polynomials with a generating function of the form $F(x z - \alpha z^2)$ are the ultraspherical, Hermite, and Chebyshev polynomials of the first kind. For special $F$ for which this is the case, we then…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…
The neighborhood polynomial of graph $G$ is the generating function for the number of vertex subsets of $G$ of which the vertices have a common neighbor in $G$. In this paper, we investigate the behavior of this polynomial under several…
The ribbon group action extends geometric duality and Petrie duality by defining two embedded graphs as twisted duals precisely when they lie within the same orbit under this group action. Twisted duality yields numerous novel properties of…
An exposition on Spivakovsky's dual graphs of valuations on function fields of dimension two is first given, leading to a proof of minimal generating sequences for the non-divisorial valuations. It should be noted that the definition of…
A linearized function field $F$ can be viewed as a Galois extension of a rational function field $K(x)$. For a totally ramified place $Q$ of degree one in $F/K(x)$, we give a unified description of the set $G(Q)$ of gaps at $Q$. As a…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We define a Frobenius algebra over fusion categories of the form Rep$(G)\boxtimes$Rep$(G)$ which generalizes the diagonal subgroup of $G\times G$. This allows us to extend field theoretical constructions which depend on the existence of a…
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of dominating sets of each cardinality in $G$. In…
We develop a diagrammatic categorification of the polynomial ring $Z[x]$. Our categorification satisfies a version of Bernstein-Gelfand-Gelfand reciprocity property with the indecomposable projective modules corresponding to $x^n$ and…
A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…
Gross, Mansour and Tucker introduced the partial-dual orientable genus polynomial and the partial-dual Euler genus polynomial. They computed these two partial-dual genus polynomials of four families of ribbon graphs, posed some research…