Related papers: Continued Fractions for partition generating funct…
We investigate some properties of the higher continued fractions defined recently by Musiker, Ovenhouse, Schiffler, and Zhang. We prove that the maps defining the higher continued fractions are increasing continuous functions on the…
We present some Euler-type recurrences for the partition function $p(n)$.
In this paper we show how to apply various techniques and theorems (including Pincherle's theorem, an extension of Euler's formula equating infinite series and continued fractions, an extension of the corresponding transformation that…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
In this article we continue a previous work in which we have generalized the Rogers Ramanujan continued fraction (RR) introducing what we call, the Ramanujan-Quantities (RQ). We use the Mathematica package to give several modular equations…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…
We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…
In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…
In the present work, we established continued fractions of level eighteen, twenty six and thirty. Further, we obtained vanishing coefficients and many algebraic relations. To validate our result colored partitions are also obtained.
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
In this paper we present a family of continued fraction expansions for $e^n$, with $n\ge 1$, with a simple expression having partial denominators given by arithmetic progressions. We give an estimate for the convergence speed showing that…
We construct new continued fraction expansions of Jacobi-type J-fractions in $z$ whose power series expansions generate the ratio of the $q$-Pochhamer symbols, $(a; q)_n / (b; q)_n$, for all integers $n \geq 0$ and where $a,b,q \in…
We find general solutions to the generating-function equation sum c_q^{(X)} z^q = F(z)^X, where X is a complex number and F(z) is a convergent power series with |F(0)| >0. We then use these results to derive finite expressions containing…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
We present here a way to evaluate a very wide class of integrals relating Ramanujans continued fraction and q-product. To do this we explore briefily a differential equation, which relates these two functions
Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties,…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…