Related papers: A Bijection Between Two Different Classes of Parti…
We construct classes of permutation polynomials over F_{Q^2} by exhibiting classes of low-degree rational functions over F_{Q^2} which induce bijections on the set of (Q+1)-th roots of unity in F_{Q^2}. As a consequence, we prove two…
This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…
We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…
In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory, $q$-series, algebra, modular forms and…
Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…
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…
Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…
Let $c_N(n)$ denotes the number of bipartitions $(\lambda, \mu)$ of a positive integer $n$ subject to the restriction that each part of $\mu$ is divisible by $N$. In this paper, we prove some congruence properties of the function $c_N(n)$…
We prove three variations of recent results due to Andrews on congruences for $NT(m,k,n)$, the total number of parts in the partitions of $n$ with rank congruent to $m$ modulo $k$. We also conjecture new congruences and relations for…
Starting from an integrable rank-$n$ vertex model, we construct an explicit family of partition functions indexed by compositions $\mu = (\mu_1,\dots,\mu_n)$. Using the Yang-Baxter algebra of the model and a certain rotation operation that…
A bijection is defined from Littlewood-Richardson tableaux to rigged configurations. It is shown that this map preserves the appropriate statistics, thereby proving a quasi-particle expression for the generalized Kostka polynomials, which…
A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…
Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…
A generalization of a beautiful $q$-series identity found in the unorganized portion of Ramanujan's second and third notebooks is obtained. As a consequence, we derive a new three-parameter identity which is a rich source of…
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…
The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…
One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…
We compute effective bounds for $\alpha(n)$, the Fourier coefficients of Ramunujan's mock theta function $f(q)$ utilizing a finite algebraic formula due to Bruinier and Schwagenscheidt. We then use these bounds to prove two conjectures of…
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$)…
Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…