July 15, 2020
We present Euler-type recurrence relations for some partition functions. Some of our results provide new recurrences for the number of unrestricted partitions of $n$, denote by $p(n)$. Others establish recurrences for partition functions not yet considered.
July 18, 2023
We recently introduced the recursive divisor function $\kappa_x(n)$, a recursive analogue of the usual divisor function. Here we calculate its Dirichlet series, which is ${\zeta(s-x)}/(2 - \zeta(s))$. We show that $\kappa_x(n)$ is related to the ordinary divisor function by $\kappa_x * \sigma_y = \kappa_y * \sigma_x$, where * denotes the Dirichlet convolution. Using this, we derive several identities relating $\kappa_x$ and some standard arithmetic functions. We also clarify ...
October 10, 2016
It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group and $k$ is the number of factors. In particular, this is $n^{n-2}$ for transposition factorizations. The goal of this work is to prove a multivariate generalization of this result. As a byproduct, we get a multivariate analog of Postnikov's...
October 30, 2016
The article studies a class of generalized factorial functions and symbolic product sequences through Jacobi type continued fractions (J-fractions) that formally enumerate the divergent ordinary generating functions of these sequences. The more general definitions of these J-fractions extend the known expansions of the continued fractions originally proved by Flajolet that generate the rising factorial function, or Pochhammer symbol, $(x)_n$, at any fixed non-zero indetermina...
October 20, 2023
In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this context. These surprising new results connect the famous classical totient function from multiplicative number theory to the additive theory of partitions.
November 26, 2012
This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the first closed form expression for the generating series of these numbers using the theory of the irreducible characters of the symmetric group. Thanks to a direct bijection we compute a similar formula and provide the first purely combinatorial...
October 14, 2020
We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
July 8, 2013
Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the symmetric group Sn. This article was published, long ago, under the title A non-recursive expression for the number of irreducible representations of the Symmetric Group Sn, Physica 114A, 1982, 361-364, North-Holland Publishing Co. The Introduction...
June 26, 2019
In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of two equations, involving natural numbers in the interval (1 $,n^{2}$).
July 10, 2020
In this expository note, we introduce the reader to compositions of a natural number, e.g., $2+1+2+1+7+1$ is a composition of 14, and $1+2$ and $2+1$ are two different compositions of 3. We discuss some simple restricted forms of compositions, e.g., $23+17+33$ is a composition of 73 into three odd parts. We derive formulas that count the number of so restricted forms of compositions of a natural number $n$, and we conclude with a brief general discussion of the topic.