Related papers: Combinatorial Identities Involving Mertens Functio…
We establish some identities in law for the convolution of a beta prime distribution with itself, involving the square root of beta distributions. The proof of these identities relies on transformations on generalized hypergeometric series…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
In this research paper, relationship between every Mersenne prime and certain Natural numbers is explored. We begin by proving that every Mersenne prime is of the form {4n + 3,for some integer 'n'} and generalize the result to all powers of…
We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…
We study two identities involving roots of unity and determinants of Hermitian matrices which have been recently proved by using the famous eigenvector-eigenvalue identity for normal matrices. In this paper, we extend these identities to a…
We give combinatorial proofs of several recent results due to Merca on the sum of different parts congruent to $r$ modulo $m$ in all partitions of $n$. The proofs make use of some well known involutions from the literature and some new…
We give combinatorial proofs of $q$-Stirling identities using restricted growth words. This includes a poset theoretic proof of Carlitz's identity, a new proof of the $q$-Frobenius identity of Garsia and Remmel and of Ehrenborg's Hankel…
We obtain identities involving symmetric and doubly symmetric polynomials. These identities provide a way of handling expressions appearing in the Atiyah-Bott-Berline-Vergne formula for Grassmannians. As corollaries, we obtain formulas for…
In this paper, we give a short proof of a relation generalizing many identities for Bernoulli numbers.
The Mertens function is defined as $M(x) = \sum_{n \leq x} \mu(n)$, where $\mu(n)$ is the M\"obius function. The Mertens conjecture states $|M(x)/\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\liminf M(x)/\sqrt{x} <…
We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…
A new parametric integral is obtained as a consequence of the Riemann hypothesis. An asymptotic multiplicability is the main property of this integral.
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…
Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let $p>3$ be a prime. We show that $$T_{p-1}\equiv\left(\frac p3\right)3^{p-1}\ \pmod{p^2},$$ where the central trinomial coefficient $T_n$ is…
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, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…
We prove a master identity for a class of sequences defined by full-history linear homogeneous recurrences with (non-negative) constant coefficients. The identity is derived in a combinatorial way, providing thus combinatorial proofs for…
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
Identities involving Mobius function values (u(j),u(k)) are used to generate a Riemann Hypothesis equivalent.