Related papers: New formulas counting one-face maps and Chapuy's r…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
Let $A_{n,i,j}$ be the number of permutations on $[n]$ with $(i-1)$ descents and $(j-1)$ inverse descents.Carlitz, Roselle and Scoville in 1966 first revealed some combinatorial and arithmetic properties of $A_{n,i,j}$,which contain a…
In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is simply connected. In a famous article, Harer and Zagier established a formula for the generating function of unicellular…
Let g and p be non-negative integers. Let A(g,p) denote the group consisting of all those automorphisms of the free group on {t_1,...,t_p, x_1,...,x_g, y_1,...y_g} which fix the element t_1t_2...t_p[x_1,y_1]...[x_g,y_g] and permute the set…
We introduce a new sequence of unsigned degenerate Stirling numbers of the first kind. Following the work of Adell-Lekuona, who represented unsigned Stirling numbers of the first kind as multiples of the expectations of specific random…
A ballot permutation is a permutation {\pi} such that in any prefix of {\pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)},…
Let $(r_{A,n}(x))_{n \in \mathbb{N}}$ be a sequence of polynomials with coefficients from a field $K$ satisfying the recurrence relation $r_{A,n}(x)= \sum_{|\alpha|\leq m} t_{\alpha,n}(x)\textbf{r}_{A,n}^\alpha(x)$ of order $d+1 \in…
We study the correlators $W_{g,n}$ arising from Orlov-Scherbin 2-Toda tau functions with rational content-weight $G(z)$, at arbitrary values of the two sets of time parameters. Combinatorially, they correspond to generating functions of…
This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…
Each degree $n+k$ polynomial of the form $(x+1)^k(x^n+c_1x^{n-1}+\cdots +c_n)$, $k\in \mathbb{N}$, is representable as Schur-Szeg\H{o} composition of $n$ polynomials of the form $(x+1)^{n+k-1}(x+a_j)$. We study properties of the affine…
The Gelfand representation of $\mathcal{S}_n$ is the multiplicity-free direct sum of the irreducible representations of $\mathcal{S}_n$. In this paper, we use a result of Adin, Postnikov, and Roichman to find a recursive generating function…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
In the paper, utilizing respectively the induction, a generating function of the Lah numbers, the Chu-Vandermonde summation formula, an inversion formula, the Gauss hypergeometric series, and two generating functions of the Stirling numbers…
Harer and Zagier proved a recursion to enumerate gluings of a $2d$-gon that result in an orientable genus $g$ surface, in their work on Euler characteristics of moduli spaces of curves. Analogous results have been discovered for other…
We formulate a generalization of a `refined class number formula' of Darmon. Our conjecture deals with Stickelberger-type elements formed from generalized Stark units, and has two parts: the `order of vanishing' and the `leading term'.…
The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…
With the use of the $(f,g)$-matrix inversion under specializations that $f=1-xy,g=y-x$, we establish an $(1-xy,y-x)$-expansion formula. When specialized to basic hypergeometric series, this $(1-xy,y-x)$-expansion formula leads us to some…
Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…