• Bulletin of the Korean Mathematical Society
• /
• v.60 no.4
• /
• pp.1017-1024
• /
• 2023

A celebrated result in the study of integer partitions is the identity due to Lehmer whereby the number of partitions of n with an even number of even parts minus the number of partitions of n with an odd number of even parts equals the number of partitions of n into distinct odd parts. Inspired by Lehmer's identity, we prove explicit formulas for evaluating generating functions for sequences that enumerate integer partitions of fixed width with an even/odd number of even parts. We introduce a technique for decomposing the even entries of a partition in such a way so as to evaluate, using a finite sum over q-binomial coefficients, the generating function for the sequence of partitions with an even number of even parts of fixed, odd width, and similarly for the other families of fixed-width partitions that we introduce.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1279-1287
• /
• 2022

A partition of n is complete if every positive integer from 1 to n can be represented by the sum of its parts. The concept of complete partitions has been extended in several ways. In this paper, we consider the number of k-relaxed r-complete partitions of n and the number of double-complete partitions of n.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.15-25
• /
• 2022

In 1963, Graham introduced a problem to find integer partitions such that the reciprocal sum of their parts is 1. Inspired by Graham's work and classical partition identities, we show that there is an integer partition of a sufficiently large integer n such that the reciprocal sum of the parts is 1, while the parts satisfy certain congruence conditions.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.111-117
• /
• 2022

Let p_a,b,m(n) be the number of integer partitions of n with more parts congruent to a modulo m than parts congruent to b modulo m. We prove that p_a,b,m(n) ≥ p_b,a,m(n) whenever 1 ≤ a < b ≤ m. We also propose some conjectures concerning series with nonnegative coefficients in their expansions.

• East Asian mathematical journal
• /
• v.35 no.1
• /
• pp.9-15
• /
• 2019

Kaavya introduce an involution on the set of partitions with crank 0 and studied the number of partitions of n which are invariant under Kaavya's involution. If a partition ${\lambda}$ with crank 0 is invariant under her involution, we say ${\lambda}$ is a self-conjugate partition with crank 0. We prove that the number of such partitions of n is equal to the number of partitions with rank 0 which are invariant under the usual partition conjugation. We also study arithmetic properties of such partitions and their q-theoretic implication.

• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.431-437
• /
• 2002

Representing a positive integer in terms of a sum of smaller numbers with certain conditions has been studied since MacMahon [5] pioneered perfect partitions. The complete partitions is in this category and studied by the second author[6]. In this paper, we study complete partitions with more specified completeness, which we call the double-complete partitions.

• East Asian mathematical journal
• /
• v.28 no.1
• /
• pp.101-107
• /
• 2012

For each dimension exceeds 1, determining the number of multi-dimensional partitions of a positive integer is an open question in combinatorial number theory. For n ${\leq}$ 14 and d ${\geq}$ 1 we derive a formula for the function ${\wp}_d(n)$ where ${\wp}_d(n)$ denotes the number of partitions of n arranged on a d-dimensional space. We also give an another definition of the d-dimensional partitions using the union of finite number of divisor sets of integers.

• East Asian mathematical journal
• /
• v.37 no.1
• /
• pp.9-17
• /
• 2021

For a positive integer n, let μd(n) be the number of multiplicative d-dimensional partitions of ${\prod\limits_{i=1}^{n}}p_i$, where pi denotes the ith prime. The number of multiplicative partitions of a square free number with n prime factors is the Bell number μ1(n) = ��n. By the definition of the function μd(n), it can be seen that for all positive integers n, μ1(n) = Tn(1) = ��n, where Tn(x) is the nth Touchard (or exponential ) polynomial. We show that, for a positive n, μ2(n) = 2nTn(1/2). We also conjecture that for all m, μ3(m) ≤ 3mTm(1/3).

• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.155-166
• /
• 2023

In 2018, Andrews introduced the partition functions ${\mathfrak{EO}}$(n) and ${\bar{\mathfrak{EO}}}$(n). The first of these denotes the number of partitions of n in which every even part is less than each odd part, and the second counts the number of partitions enumerated by the first in which only the largest even part appears an odd number of times. In 2021, Pore and Fathima introduced a new partition function ${\mathfrak{EO}}_e$(n) which counts the number of partitions of n which are enumerated by ${\bar{\mathfrak{EO}}}$(n) together with the partitions enumerated by ${\bar{\mathfrak{EO}}}$(n) where all parts are odd and the number of parts is even. They also proved some particular congruences for ${\bar{\mathfrak{EO}}}$(n) and ${\mathfrak{EO}}_e$(n). In this paper, we establish infinitely many families of congruences modulo 2, 4, 5 and 8 for ${\bar{\mathfrak{EO}}}$(n) and modulo 4 for ${\mathfrak{EO}}_e$(n). For example, if p ≥ 5 is a prime with Legendre symbol $({\frac{-3}{p}})=-1$, then for all integers n ≥ 0 and α ≥ 0, we have ${\bar{\mathfrak{EO}}}(8{\cdot}p^{2{\alpha}+1}(pn+j)+{\frac{19{\cdot}p^{2{\alpha}+2}-1}{3}}){\equiv}0$ (mod 8); 1 ≤ j ≤ (p - 1).

• Kyungpook Mathematical Journal
• /
• v.58 no.4
• /
• pp.599-613
• /
• 2018

We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums. We also derive new identities for Bell polynomials.