Related papers: A categorification for the partial-dual genus poly…
A commutative Poisson subalgebra of the Poisson algebra of polynomials on the Lie algebra of n x n matrices over ${\Bbb C}$ is introduced which is the Poisson analogue of the Gelfand-Zeitlin subalgebra of the universal enveloping algebra.…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
We present procedures to calculate the set of Arf numerical semigroups with given genus, given conductor and given genus and conductor. We characterize the Kunz coordinates of an Arf numerical semigroup. We also describe Arf numerical…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
The partial Petrial polynomial was first introduced by Gross, Mansour, and Tucker as a generating function that enumerates the Euler genera of all possible partial Petrials on a ribbon graph. Yan and Li later extended this polynomial…
For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…
We provide a complete classification of the n-ary semigroup structures defined by polynomial functions over infinite commutative integral domains with identity, thus generalizing G{\l}azek and Gleichgewicht's classification of the…
The neighborhood polynomial of graph $G$, denoted by $N(G,x)$, is the generating function for the number of vertex subsets of $G$ which are subsets of open neighborhoods of vertices in $G$. For any graph polynomial, it can be useful to…
Recently, Gross, Mansour and Tucker introduced the partial-twuality polynomials. In this paper, we find that when there are enough parallel edges, any multiple graph is a negative answer to the problem 8.7 in their paper [European J.…
In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…
We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical…
We provide recipe theorems for the Bollob\`as and Riordan polynomial $\mathcal{R}$ defined on classes of ribbon graphs with half-edges introduced in arXiv:1310.3708[math.GT]. We also define a generalized transition polynomial $Q$ on this…
For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.
In this paper we give a module-theoretic description of the isomorphism classes of abelian varieties $A$ isogenous to $B^r$, where the characteristic polynomial $g$ of Frobenius of $B$ is an ordinary square-free $q$-Weil polynomial, for a…
We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree $T$ is the generating function of a class of subtrees of $T$. We prove that the polynomial is a complete isomorphism…
In this work, we introduce the boundary polynomial of a graph $G$ as the ordinary generating function in two variables $B(G;x,y):= \displaystyle\sum_{S\subseteq V(G)} x^{|B(S)|}y^{|S|}$, where $B(S)$ denotes the outer boundary of $S$. We…
The partial group algebra of a group G over a field K, denoted by K_{par}(G), is the algebra whose representations correspond to the partial representations of G over K-vector spaces. In this paper we study the structure of the partial…
We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field of odd characteristic. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs…
Gross, Mansour and Tucker introduced the partial-twuality polynomial of a ribbon graph. Chumutov and Vignes-Tourneret posed a problem: it would be interesting to know whether the partial duality polynomial and the related conjectures would…
The aim of this paper is to investigate generating functions for modification of the Milne-Thomson's polynomials, which are related to the Bernoulli polynomials and the Hermite polynomials. By applying the Umbral algebra to these generating…