In this paper we derive some identities and inequalities on the Möbius mu function. Our main tool is phi functions for intervals of positive integers and their unions.
Using elementary means, we prove several identities involving the Möbius function, generalizing in the multidimensional case well-known formulas coming from convolution arguments.
In important work on the parity of the partition function, Ono related values of the partition function to coefficients of a certain mock theta function modulo 2. In this paper, we use Möbius inversion to give analogous results which relate several combinatorial functions via identities rather than congruences.
We obtained the formulas for the quantities of positive, negative and zero values of the Mobius function for any real x in terms of the Mobius function values for square root of x - similar to the identities we found earlier for the Mertens function [1]. Using the Dirac delta function approach [3, 2] we propose the equations showing how the Mertens and related functions can generate the output values.
In this note we give some identities which involve the Mertens function M(n). Our proofs are combinatorial with relatively prime subsets as a main tool.
In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated proofs using the Wilf-Zeilberger(WZ) method.
In this paper, we provide combinatorial proofs for certain partition identities which arise naturally in the context of Langlands' beyond endoscopy proposal. These partition identities motivate an explicit plethysm expansion of $\mathrm{Sym}^j(\mathrm{Sym}^kV)$ for $\mathrm{GL}_2$ in the case $k=3$. We compute the plethysm explicitly for the cases $k=3, 4$. Moreover, we use these expansions to explicitly compute the basic function attached to the symmetric power $L$-function of $\mathrm{GL}_2$ for these two cases.
In this paper we establish plenty of number theoretic and combinatoric identities involving generalized Bernoulli and Stirling numbers of both kinds. These formulas are deduced from Pascal type matrix representations of Bernoulli and Stirling numbers. For this we define and factorize a modified Pascal matrix corresponding to Bernoulli and Stirling cases.
The class of Lambert series generating functions (LGFs) denoted by $L_α(q)$ formally enumerate the generalized sum-of-divisors functions, $σ_α(n) = \sum_{d|n} d^α$, for all integers $n \geq 1$ and fixed real-valued parameters $α\geq 0$. We prove new formulas expanding the higher-order derivatives of these LGFs. The results we obtain are combined to express new identities expanding the generalized sum-of-divisors functions. These new identities are expanded in the form of sums of polynomially scaled multiples of a related class of divisor sums depending on $n$ and $α$.
Möbius function and primes: an identity factory with applications
CNRS / Institut de Mathématiques de Marseille, Aix Marseille Université(法国国家科学研究中心/马塞数学研究所,艾克斯马赛大学);Department of Mathematics and Statistics, University of Turku(图尔库大学数学与统计系)
We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419].
In this paper we give a new formula for the $n$-th power of a $2\times2$ matrix. More precisely, we prove the following: Let $A= \left ( \begin{matrix} a & b \\ c & d \end{matrix} \right )$ be an arbitrary $2\times2$ matrix, $T=a+d$ its trace, $D= ad-bc$ its determinant and define \[ y_{n} :\,= \sum_{i=0}^{\lfloor n/2 \rfloor}\binom{n-i}{i}T^{n-2 i}(-D)^{i}. \] Then, for $n \geq 1$, \begin{equation*} A^{n}=\left ( \begin{matrix} y_{n}-d \,y_{n-1} & b \,y_{n-1} \\ c\, y_{n-1}& y_{n}-a\, y_{n-1} \end{matrix} \right ). \end{equation*} We use this formula together with an existing formula for the …
Recently, the numbers $Y_{n}(λ)$ and the polynomials $Y_{n}(x,λ)$ have been introduced by the second author [22]. The purpose of this paper is to construct higher-order of these numbers and polynomials with their generating functions. By using these generating functions with their functional equations and derivative equations, we derive various identities and relations including two recurrence relations, Vandermonde type convolution formula, combinatorial sums, the Bernstein basis functions, and also some well known families of special numbers and their interpolation functions such as the Apos…
For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq 1}\frac{1}{r_1r_2\cdots r_m} \end{equation*} and $$ \sum\limits_{k=1}^n(-1)^{n-k}\binom{n}{k}k^n = n!, $$ and then we produce the generating function and an integral representation for $S_n(m)$. Using them we evaluate many interesting finite and infinite harmonic sums in closed form. For example, we show that $$ ζ(3)=\frac{1}{9}\sum\limits_{n=1}^\infty\frac{H_n^3…
Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of nonempty subsets of $A$ which are relatively prime and the number of nonempty subsets of $A$ which are relatively prime to $n$. Related formulas are also obtained for the number of such subsets having some fixed cardinality. This extends previous work for the cases where $A$ is an interval or a set in arithmetic progression. Applications include: a) An exact formul…
We find two combinatorial identities on the theta series of the root lattices of the finite-dimensional simple Lie algebras of type $D_{4n}$ and the cosets in their integral duals, in terms of the well-known Essenstein series $E_4(z)$ and Ramanujan series $\Dlt_{24}(z)$. Using these two identities, we determine the theta series of certain infinite families of postive definite even unimodular lattices obtained by gluing finite copies of the root lattices of the finite-dimensional simple Lie algebras of type $D_{2n}$. It turns out that these theta series are weighted symmetric polynomials of two…
The main aim of this article is to compute all the moments of the number of $p^\ell$-torsion elements in some type of nite abelian groups. The averages involved in these moments are those de ned for the Cohen-Lenstra heuristics for class groups and their adaptation for Tate-Shafarevich groups. In particular, we prove that the heuristic model for Tate-Shafarevich groups is compatible with the recent conjecture of Poonen and Rains about the moments of the orders of $p$-Selmer groups of elliptic curves. For our purpose, we are led to de ne certain polynomials indexed by integer partitions and to …
We discuss certain identities involving $μ(n)$ and $M(x)=\sum_{n\leq x}μ(n)$, the functions of Möbius and Mertens. These identities allow calculation of $M(N^d)$, for $d=2,3,4,\ldots\ $, as a sum of $O_d \left( N^d(\log N)^{2d - 2}\right)$ terms, each a product of the form $μ(n_1) \cdots μ(n_r)$ with $r\leq d$ and $n_1,\ldots , n_r\leq N$. We prove a more general identity in which $M(N^d)$ is replaced by $M(g,K)=\sum_{n\leq K}μ(n)g(n)$, where $g(n)$ is an arbitrary totally multiplicative function, while each $n_j$ has its own range of summation, $1,\ldots , N_j$. We focus on the case $d=2$, $K…
We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain overpartition pairs recently introduced by Bringmann, Lovejoy and Osburn. For example, one of our identities gives a closed-form evaluation of a double series in terms of Chebyshev polynomials of the second kind, thereby resulting in an analogue of Euler's pentagonal number theorem. Another of our results expresses a multi-sum involving $N(r, s, m, n)$ in te…
We present a method for proving q-series identities by combinatorial telescoping, in the sense that one can transform a bijection or a classification of combinatorial objects into a telescoping relation. We shall illustrate this method by giving a combinatorial proof of Watson's identity which implies the Rogers-Ramanujan identities.
Here we consider the $q$-series coming from the Hall-Littlewood polynomials, \begin{equation*} R_ν(a,b;q)=\sum_{\substack{λ\\[1pt] λ_1\leq a}} q^{c|λ|} P_{2λ}\big(1,q,q^2,\dots;q^{2b+d}\big). \end{equation*} These series were defined by Griffin, Ono, and Warnaar in their work on the framework of the Rogers-Ramanujan identities. We devise a recursive method for computing the coefficients of these series when they arise within the Rogers-Ramanujan framework. Furthermore, we study the congruence properties of certain quotients and products of these series, generalizing the famous Ramanujan congru…
In this paper we prove some combinatorial identities which can be considered as generalizations and variations of remarkable Chu-Vandermonde identity. These identities are proved by using an elementary combinatorial-probabilistic approach to the expressions for the $k$-th moments ($k=1,2,3$) of some particular cases of recently investigated discrete random variables. Using one of these Chu-Vandermonde-type identities, two combinatorial congruences are established.
We present a different combinatorial interpretations of Lucas and Gibonacci numbers. Using these interpretations we prove several new identities, and simplify the proofs of several known identities. Some open problems are discussed towards the end of the paper.
In his lost notebook, Ramanujan listed 5 identities related to the false theta function $$f(q)=\sum_{n=0}^\infty (-1)^nq^{n(n+1)/2}.$$ A new combinatorial interpretation and proof of one of these identities is given. The methods of the proof allow for new multivariate generalizations of this identity. Additionally, the same technique can be used to obtained a combinatorial interpretation of another one of the identities.
We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews via generating functions. Let $a(n)$ be the number of partitions of $n$ such that the set of even parts has exactly one element, $b(n)$ be the difference between the number of parts in all odd partitions of $n$ and the number of parts in all distinct partitions of $n$, and $c(n)$ be the number of partitions of $n$ in which exactly one part is repeated. Then,…
In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the Schroeter, Russell and Ramanujan type. The goal of this paper is to use the master bijection of our previous work to show combinatorially several new and highly nontrivial colored partition identities. We conclude by listing a number of further interesting identities of the same type as conjectures.
In these two companion papers, we give infinite families of partition identities which generalise Primc's and Capparelli's identities, and study their consequences on the theory of crystal bases of the affine Lie algebra $A_{n-1}^{(1)}.$ In this first paper, we focus on combinatorial aspects. We give a $n^2$-coloured generalisation of Primc's identity by constructing a $n^2 \times n^2$ matrix of difference conditions, Primc's original identities corresponding to $n=2$ and $n=3$. While most coloured partition identities in the literature connect partitions with difference conditions to partitio…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A number of weighted generalized Fibonacci number summation identities are derived this way. From these identities some infinite series, generating functions and convolution identities are obtained. In addition, some weighted generalized Fibonacci number summation identities with binomial coefficients are derived. Many examples of both types of summation identities…
In 1984, Bressoud and Subbarao obtained an interesting weighted partition identity for a generalized divisor function, by means of combinatorial arguments. Recently, the last three named authors found an analytic proof of the aforementioned identity of Bressoud and Subbarao starting from a $q$-series identity of Ramanujan. In the present paper, we revisit the combinatorial arguments of Bressoud and Subbarao, and derive a more general weighted partition identity. Furthermore, with the help of a fractional differential operator, we establish a few more Bressoud-Subbarao type weighted partition i…
We provide a general and unified combinatorial framework for a number of colored partition identities, which include the five, recently proved analytically by B. Berndt, that correspond to the exceptional modular equations of prime degree due to H. Schroeter, R. Russell and S. Ramanujan. Our approach generalizes that of S. Kim, who has given a bijective proof for two of these five identities, namely the ones modulo 7 (also known as the Farkas-Kra identity) and modulo 3. As a consequence of our method, we determine bijective proofs also for the two highly nontrivial identities modulo 5 and 11, …