Related papers: Hyperbinary partitions and q-deformed rationals

A hyperbinary expansion of a positive integer n is a partition of n into powers of 2 in which each part appears at most twice. In this paper, we consider a generalization of this concept and a certain statistic on the corresponding set of…

We introduce a $q$-analog of the higher continued fractions introduced by the last three authors in a previous work (together with Gregg Musiker), which are simultaneously a generalization of the $q$-rational numbers of Morier-Genoud and…

We consider the $q$-deformation of rational numbers introduced recently by Morier-Genoud and Ovsienko. We propose three enumerative interpretations of these $q$-rationals: in terms of a new version of Ostrowski's numeration system for…

Recently, Morier-Genoud and Ovsienko introduced a $q$-deformation of rational numbers. More precisely, for an irreducible fraction $\frac{r}s>0$, they constructed coprime polynomials $\mathcal{R}_{\frac{r}s}(q),~ \mathcal{S}_{\frac{r}s}(q)…

We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…

For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…

It was recently shown that $q\omega(q)$, where $\omega(q)$ is one of the third order mock theta functions, is the generating function of $p_{\omega}(n)$, the number of partitions of a positive integer $n$ such that all odd parts are less…

As a homomorphic image of the hyperalgebra $U_{q,R}(m|n)$ associated with the quantum linear supergroup $U_\upsilon(\mathfrak{gl}_{m|n})$, we first give a presentation for the $q$-Schur superalgebra $S_{q,R}(m|n,r)$ over a commutative ring…

Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…

It is well known that, whenever $k$ divides $n$, the complete $k$-uniform hypergraph on $n$ vertices can be partitioned into disjoint perfect matchings. Equivalently, the set of $k$-subsets of an $n$-set can be partitioned into parallel…

Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…

A q-series with nonnegative power series coefficients is called positive. The partition statistics BG-rank is defined as an alternating sum of parities of parts of a partition. It is known that the generating function for the number of…

For positive integers $n, L$ and $s$, consider the following two sets that both contain partitions of $n$ with the difference between the largest and smallest parts bounded by $L$: the first set contains partitions with smallest part $s$,…

We prove new double summation hypergeometric $q$-series representations for several families of partitions, including those that appear in the famous product identities of G\"ollnitz, Gordon, and Schur. We give several different proofs for…

I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…

We determine the structure of the partition algebra $P_n(Q)$ (a generalized Temperley-Lieb algebra) for specific values of $Q \in \C$, focusing on the quotient which gives rise to the partition function of $n$ site $Q$-state Potts models…

There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions…

We revisit a well-known divide-and-conquer maximin recurrence $f(n) = \max(\min(n_1,n_2) + f(n_1) + f(n_2))$ where the maximum is taken over all proper bipartitions $n = n_1+n_2$, and we present a new characterization of the pairs…

A partition of a positive integer $n$ is said to be $t$-core if none of its hook lengths are divisible by $t$. Recently, two analogues, $\overline{a}_t(n)$ and $\overline{b}_t(n)$, of the $t$-core partition function, $c_t(n)$, have been…

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…