Related papers: Computation of q-Binomial Coefficients with the $P…

The restricted partition function $p_{N}(n)$ counts the partitions of $n$ into at most $N$ parts. In the nineteenth century Sylvester showed that these partitions can be expressed as a sum of $k$-periodic quasi-polynomials ($1\leq k\leq N$)…

Let $p \equiv 1 \pmod{4}$ be prime, let $m$ and $n$ be integers such that $p=m^2+n^2$, and let $b$ be a positive integer. Let $Q(z,q) = (z,q/z,q;q)_{\infty}(qz^2,q/z^2;q^2)_{\infty}$ denote the product appearing in the quintuple product…

The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…

For any positive integers $s$ and $t$, let $Q_{t}^{s}(n)$ denotes the number of partitions of a positive integer $n$ into distinct parts such that no part is congruent to $s$ or $t-s$ modulo $t$. We prove some Ramanujan-type congruences for…

In this paper, first we introduce a quantity called a partition function for a quiver mutation sequence. The partition function is a generating function whose weight is a $q$-binomial associated with each mutation. Then, we show that the…

This paper addresses the problem of finding $Q_{m,t}\left(n\right)$, the number of possible ways to partition any member $n$ of the cyclic group $\mathbb{Z}/m\mathbb{Z}$ into $t$ distinct parts. When $m$ is odd, it was previously known that…

In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…

We describe an algorithm for using a quantum computer to calculate mean values of observables and the partition function of a quantum system. Our algorithm includes two sub-algorithms. The first sub-algorithm is for calculating, with…

In the paper, the quantum-statistical approach is used to estimate the number of restricted plane partitions of an integer $n$ with the number of parts not exceeding some finite $N$. The analogy between this number-theoretical problem and…

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the…

We obtain connection coefficients between $q$-binomial and $q$-trinomial coefficients. Using these, one can transform $q$-binomial identities into a $q$-trinomial identities and back again. To demonstrate the usefulness of this procedure we…

We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

The integer division of a numerator n by a divisor d gives a quotient q and a remainder r. Optimizing compilers accelerate software by replacing the division of n by d with the division of c * n (or c * n + c) by m for convenient integers c…

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

We consider some $q$-series which depend on a pair of positive integers $(k,m)$. While positivity of these series holds for the first few values of $(k,m)$, the situation is quite unclear for other values of $(k,m)$. In addition, our series…