본문 바로가기
KERD
논문KCI 등재

Enumeration of relaxed complete partitions and double-complete partitions

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

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$.

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$.

참고문헌 (7)

  1. G. E. Andrews, "On a conjecture of Hanna connecting distinct part and complete partitions", Ann. Comb, 24(2), pp.217~224 (2020)[DOI]
  2. J. Bruno, "Relaxed complete partitions: an error-correcting Bachet’s problem", Integers, 18, pp.18~ (2018)
  3. HoKyu Lee, "The double-complete partitions of integers", 대한수학회논문집, 17(3), pp.431~437 (2002), 대한수학회
  4. P. A. MacMahon, "Combinatory Analysis" (1960), Chelsea Publishing Co
  5. E. O’Shea, "M-partitions : optimal partitions of weight for one scale pan", Discrete Math, 289(1-3), pp.81~93 (2004)[DOI]
  6. S. K. Park, "Complete partitions", Fibonacci Quart, 36(4), pp.354~360 (1998)
  7. S. K. Park, "The r-complete partitions", Discrete Math, 183(1-3), pp.293~297 (1998)[DOI]

관련 논문AI추천

이 간행물의 다른 논문 (17건)