首页> 外文期刊>Journal of Combinatorial Theory, Series A >Chain Partitions of Products of Two Chains
【24h】

Chain Partitions of Products of Two Chains

机译:两链产品的链划分

获取原文
获取原文并翻译 | 示例
           

摘要

We characterize sequences of positive integers (m_1, ..., m_p), m_1 >= ... >= m_p > 0, for which the product n * k (of n-element and k-element chains), n >= k, can be partitioned into chains C_1, ..., C_p such that |C_i| = m_i, for i = 1, ..., p. The main result says that such a partition exists if and only if #SIGMA#_(i = 1)~i m_i <= #SIGMA#_(i=1)~i (k + n + 1 2i), for i = 1, ..., k and #SIGMA#_(i = 1)~p m_i = nk.
机译:我们刻画正整数(m_1,...,m_p),m_1> = ...> = m_p> 0的序列,其乘积n * k(n个元素和k个元素链),n> = k可以划分为链C_1,...,C_p,使得| C_i | = m_i,对于i = 1,...,p。主要结果表明,当且仅当#SIGMA #_(i = 1)〜i m_i <= #SIGMA #_(i = 1)〜i(k + n + 1 2i),对于i =,这种分区才存在。 1,...,k和#SIGMA #_(i = 1)〜p m_i = nk。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号