Partition of a set of integers into subsets, with prescribed sums

檔案

本條目沒有附加檔案。

日期

2005-12-01

類型

期刊名稱

TAIWANESE JOURNAL OF MATHEMATICS

卷期與頁次

第 9 卷第 4 期,頁 629–638

ISSN

1027-5487

語言

英文

摘要

A nonincreasing sequence of positive integers < m(1), m(2),(...), m(k)> is said to be n-realizable if the set I-n = {1, 2,(...), n} can be partitioned into k mutually disjoint subsets S-1, S-2,(...), S-k such that Sigma(x is an element of Si) x = m(i) for each 1. <= i <= k. In this paper, we will prove. that a nonincreasing sequence of positive integers < m(1), m(2),(...),m(k)> is n-realizable under the. conditions that Sigma(i=1)(k) m(i) = ((n+1)(2)) and m(k-1) >= n.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, F., Fu, H., Wang, Y., & Zhou, J. (2005). Partition of a set of integers into subsets, with prescribed sums. TAIWANESE JOURNAL OF MATHEMATICS, 9(4), 629–638. https://ir.lib.nycu.edu.tw/handle/11536/13031

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/13031