FINk-1, one considers all maps from FINk to FINj for 0 <= j <= k arising from nond'/> Gowers' Ramsey Theorem for generalized tetris operations
首页> 外文期刊>Journal of Combinatorial Theory, Series A >Gowers' Ramsey Theorem for generalized tetris operations
【24h】

Gowers' Ramsey Theorem for generalized tetris operations

机译:Gowers'广义俄罗斯俄罗斯方程式的Ramsey定理

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

摘要

We prove a generalization of Cowers' theorem for FIN kappa where, instead of the single tetris operation T : FINk -> FINk-1, one considers all maps from FINk to FINj for 0 <= j <= k arising from nondecreasing surjections f : {0, 1,..., k} --+ {0,1,..., j}. This answers a question of Bartogova and Kwiatkowska. We also describe how to prove a common generalization of such a result and the Galvin-Glazer-Hindman theorem on finite products, in the setting of layered partial semigroups introduced by Farah, Hindman, and McLeod. (C) 2017 Elsevier Inc. All rights reserved.
机译:我们证明了COW Kappa的考定理的概括,而不是单个方块操作T:Fink - > Fink-1,其中将来自Fink到Finj的所有地图都认为来自非解剖学捕发的0 <= J <= K: {0,1,...,k} - + {0,1,...,J}。 这回答了Bartogova和Kwiatkowska的问题。 我们还介绍了如何在Farah,Hindman和McLeod引入的分层部分半群的设置中,如何证明这种结果和Galvin-Glazer-Hindman定理的共同概括。 (c)2017年Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号