Partitions and (m and n) sums of products -: Two cell partition

被引：0

作者：

Smith, GL ^{[1
]}

机构：

[1] Norfolk State Univ, Dept Math, Norfolk, VA 23504 USA

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2001年 / 14卷 / 03期

关键词：

partition; sequence; sums of products; finite products;

D O I：

10.1137/S0895480198349014

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We let SPm([X-t](t=1)(infinity)) denote the sums of m increasing products from a sequence [X-t](t=1)(infinity). Given m not equal n, we construct a two cell partition of N so that neither cell contains SPn[X](t=1)(infinity)) boolean OR SPm([y] >(infinity)(t=1)) for any sequences [X-t](t=1)(infinity) and [y](t=1)(infinity).

引用

页码：356 / 369

页数：14