[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.4134/BKMS.b210749

ENUMERATION OF RELAXED COMPLETE PARTITIONS AND DOUBLE-COMPLETE PARTITIONS

An, Suhyung (Department of Mathematics Yonsei University)
Cho, Hyunsoo (Institute of Mathematical Sciences Ewha Womans University)

Publication Information

Bulletin of the Korean Mathematical Society / v.59, no.5, 2022 , pp. 1279-1287 More about this Journal

Abstract

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.

Keywords

Complete partitions; relaxed complete partitions; double-complete partitions;

Citations & Related Records

Times Cited By KSCI : 1 (Citation Analysis)

Reference
Cited By KSCI

1	G. E. Andrews, G. Beck, and B. Hopkins, On a conjecture of Hanna connecting distinct part and complete partitions, Ann. Comb. 24 (2020), no. 2, 217-224. https://doi.org/10.1007/s00026-019-00476-1 DOI
2	P. A. MacMahon, Combinatory Analysis, Chelsea Publishing Co., New York, 1960.
3	S. K. Park, The r-complete partitions, Discrete Math. 183 (1998), no. 1-3, 293-297. https://doi.org/10.1016/S0012-365X(97)00177-5 DOI
4	H. Lee and S. Park, The double-complete partitions of integers, Commun. Korean Math. Soc. 17 (2002), no. 3, 431-437. https://doi.org/10.4134/CKMS.2002.17.3.431 DOI
5	E. O'Shea, M-partitions: optimal partitions of weight for one scale pan, Discrete Math. 289 (2004), no. 1-3, 81-93. https://doi.org/10.1016/j.disc.2004.07.016 DOI
6	S. K. Park, Complete partitions, Fibonacci Quart. 36 (1998), no. 4, 354-360.
7	J. Bruno and E. O'Shea, Relaxed complete partitions: an error-correcting Bachet's problem, Integers 18 (2018), Paper No. A41, 18 pp.