Related papers: A note on the trinomial analogue of Bailey's lemma
In this short note, we discuss the Barndorff-Nielsen lemma, which is a generalization of well-known Borel-Cantelli lemma. Although the result stated in the Barndorff-Nielsen lemma is correct, it does not follow from the argument proposed in…
We establish new operational formulae of Burchnall type for the complex disk polynomials (generalized Zernike polynomials). We then use them to derive some interesting identities involving these polynomials. In particular, we establish…
An elliptic $BC_n$ generalization of the classical two parameter Bailey Lemma is proved, and a basic one parameter $BC_n$ Bailey Lemma is obtained as a limiting case. Several summation and transformation formulas associated with the root…
Some Dirichlet-like functions, attached to a pair (periodic function, polynomial) are introduced and studied. These functions generalize the standard Dirichlet L-functions of Dirichlet characters. They have similar properties, being…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
The purpose of this paper is to give some new identities for the Bernoulli, the Euler and the Genocchi numbers and polynomials.
We give a short proof of Chevalley's theorem that every algebraic group is an extension of an Abelian variety by a linear algebraic group. Along the way we treat Bertini's irreducibility theorem.
In this note we present a combinatorial proof of an identity involving poly-Bernoulli numbers and Genocchi numbers. We introduce the combinatorial objects, $m-$barred Callan sequences and show that the identity holds in a more general…
In this paper, we obtain a generalization of an identity due to Carlitz on Bernoulli polynomials. Then we use this generalized formula to derive two symmetric identities which reduce to some known identities on Bernoulli polynomials and…
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.
In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…
In this short note, we prove a conjecture recently posed by Alekseyev, Amdeberhan, Shallit, and Vukusic on the 3-adic valuation of a cubic binomial sum.
When searching for Calabi.Yau differential equations, often different formulas for the coefficients give the same differential equation. The coefficients are usually sums (simple, double or triple) of products of binomial coefficients. This…
This paper aims to construct a new family of numbers and polynomials which are related to the Bell numbers and polynomials by means of the confluent hypergeometric function. We give various properties of these numbers and polynomials…
Recently we introduced a new class of relations for Bernoulli symmetric polynomials. This manuscript shows that these relations are valid for arbitrary homogeneous symmetric polynomial. Analysis of these relations leads to the discovery of…
The ${\mathbb B}_n^{(k)}$ poly-Bernoulli numbers --- a natural generalization of classical Bernoulli numbers ($B_n={\mathbb B}_n^{(1)}$) --- were introduced by Kaneko in 1997. When the parameter $k$ is negative then ${\mathbb B}_n^{(k)}$ is…
Combining ideas of Pham, Sah, Sawhney, and Simkin on spread perfect matchings in super-regular bipartite graphs with an algorithmic blow-up lemma, we prove a spread version of the blow-up lemma. Intuitively, this means that there exists a…
We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…