Related papers: Hyperbinary partitions and q-deformed rationals
Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…
In his study of Nekrasov-Okounkov type formulas on "partition theoretic" expressions for families of infinite products, Han discovered seemingly unrelated $q$-series that are supported on precisely the same terms as these infinite products.…
We investigate some weighted integer partitions whose generating functions are double-series. We will establish closed formulas for these $q$-double series and deduce that their coefficients are non-negative. This leads to inequalities…
An integer partition of a positive integer $n$ is called to be $t$-core if none of its hook lengths are divisible by $t$. Recently, Gireesh, Ray and Shivashankar [`A new analogue of $t$-core partitions', \textit{Acta Arith.} \textbf{199}…
We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…
Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…
In this paper, we initiate a study into the explicit construction of irreducible representations of the Hecke algebra $H_n(q)$ of type $A_{n-1}$ in the non-generic case where $q$ is a root of unity. The approach is via the Specht modules of…
The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…
We present a natural multiplicative theory of integer partitions (which are usually considered in terms of addition), and find many theorems of classical number theory arise as particular cases of extremely general combinatorial structure…
A set partition of $[n] := \{1, 2, \dots, n \}$ is called {\em $r$-Stirling} if the numbers $1, 2, \dots, r$ belong to distinct blocks. Haglund, Rhoades, and Shimozono constructed graded ring $R_{n,k}$ depending on two positive integers $k…
Representations of Quantum Groups U_q (g_n), g_n any semi simple Lie algebra of rank n, are constructed from arbitrary representations of rank n-1 quantum groups for q a root of unity. Representations which have the maximal dimension and…
Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…
Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…
Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…
Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let the representation function $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. In…
For each $s\in\{2,4\}$, the generating function of $R_s(n)$, the number of partitions of $n$ into odd parts or congruent to $0$, $\pm s\pmod {10}$, arises naturally in regime III of Rodney Baxter's solution of the hard-hexagon model of…
In this article, we give a classification of irreducible completely splittable representations of affine Hecke-Clifford superalgebras $H_n^{\mathrm{aff}}(q)$ when $q^2$ is a primitive $h$-th root of unity. As an application, we derive a…
We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…
The quantum integer [n]_q is the polynomial 1 + q + q^2 + ... + q^{n-1}, and the sequence of polynomials { [n]_q }_{n=1}^{\infty} is a solution of the functional equation f_{mn}(q) = f_m(q)f_n(q^m). In this paper, semidirect products of…
A binary partition of a positive integer $n$ is a partition of $n$ in which each part has size a power of two. In this note we first construct a Gray sequence on the set of binary partitions of $n$. This is an ordering of the set of binary…