DOI QR코드

DOI QR Code

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)
  • Received : 2021.10.11
  • Accepted : 2022.01.24
  • Published : 2022.09.30

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

Acknowledgement

Suhyung An was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education (No. 2019R1I1A1A01059433). Hyunsoo Cho was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIT) (No. 2021R1C1C2007589) and the Ministry of Education (No. 2019R1A6A1A11051177).

References

  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
  2. J. Bruno and E. O'Shea, Relaxed complete partitions: an error-correcting Bachet's problem, Integers 18 (2018), Paper No. A41, 18 pp.
  3. 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
  4. P. A. MacMahon, Combinatory Analysis, Chelsea Publishing Co., New York, 1960.
  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
  6. S. K. Park, Complete partitions, Fibonacci Quart. 36 (1998), no. 4, 354-360.
  7. 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