相关论文: Combinatorics of binomial decompositions of the si…

In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

We establish a polynomial recursion formula for linear Hodge integrals. It is obtained as the Laplace transform of the cut-and-join equation for the simple Hurwitz numbers. We show that the recursion recovers the Witten-Kontsevich theorem…

We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…

We introduce the combinatorial notion of posetted trees and we use it in order to write an explicit expression of the Baker-Campbell-Hausdorff formula.

Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Let $p>3$ be a prime. For any $p$-adic integer $a$, we determine $$\sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k,\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k^{(2)},\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}k\frac{H_k^{(2)}}{2k+1}$$ modulo…

We define and study the combinatorial properties of compositional Bernoulli numbers and polynomials within the framework of rational combinatorics.

In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…

From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

We prove two explicit formulae for one-part double Hurwitz numbers with completed 3-cycles. We define "combinatorial Hodge integrals" from these numbers in the spirit of the celebrated ELSV formula. The obtained results imply some explicit…

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…