Related papers: A categorification for the partial-dual genus poly…
The domination polynomial D(G,x) is the ordinary generating function for the dominating sets of an undirected graph G=(V,E) with respect to their cardinality. We consider in this paper representations of D(G,x) as a sum over subsets of the…
A theorem of Dubrovin establishes the relationship between the GUE partition function and the partition function of Gromov-Witten invariants of the complex projective line. Based on this theorem we derive loop equations for the Gaussian…
We study three types of generalized partial fractional operators. An extension of Green's theorem, by considering partial fractional derivatives with more general kernels, is proved. New results are obtained, even in the particular case…
A closed expression is given for the generating function of (virtual) Poincar\'e polynomials of moduli spaces of semi-stable sheaves on the projective plane $\mathbb{P}^2$ with arbitrary rank $r$ and Chern classes. This generating function…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
The structure of filtered algebras of Grothendieck's differential operators of truncated polynomials in one variable and graded Poisson algebras of their principal symbols is explicitly determined. A related infinitesimal-birational duality…
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…
In this paper we compute the Frobenius number of certain {\em Fibonacci numerical semigroups}, that is, numerical semigroups generated by a set of Fibonacci numbers, in terms of Fibonacci numbers.
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
Let $G_n= \prod_{k=0}^n \binom{n}{k},$ the product of the elements of the $n$-th row of Pascal's triangle. This paper studies the partial factorizations of $G_n$ given by the product $G(n,x)$ of all prime factors $p$ of $G_n$ having $p \le…
For a given graph $G$, we construct an associated commutative algebra, whose dimension is equal to the number of $t$-labeled forests of $G$. We show that the dimension of the $k$-th graded component of this algebra also has a combinatorial…
In this paper, given a semisimple algebraic group $\bf G$ of rank 2, we construct a special semiorthogonal decomposition in the derived category of coherent sheaves on the flag variety ${\bf G}/{\bf B}$. These decompositions are defined…
The main aim of this paper is to provide a unified approach to deriving identities for the Bernstein polynomials using a novel generating function. We derive various functional equations and differential equations using this generating…
In this paper, for each graph $G$, we def\mbox{}ine a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of $G$. Furthermore, we def\mbox{}ine a chain complex…
The purpose of the paper is to construct a new representation of dual quaternions called bi$-$periodic dual Fibonacci quaternions. These quaternions are originated as a generalization of the known quaternions in literature such as dual…
Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…
A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…
We identify a class of "semi-modular" forms invariant on special subgroups of $GL_2(\mathbb Z)$, which includes classical modular forms together with complementary classes of functions that are also nice in a specific sense. We define an…