首页> 外文期刊>Illinois Journal of Mathematics >MULTIPLE ERGODIC AVERAGES FOR FLOWS AND AN APPLICATION
【24h】

MULTIPLE ERGODIC AVERAGES FOR FLOWS AND AN APPLICATION

机译:流量的多个平均数及其应用

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

摘要

We show the L~2-convergence of continuous time er-godic averages of a product of functions evaluated at return times along polynomials. These averages are the continuous time version of the averages appearing in Furstenberg's proof of Sze-meredi's Theorem. For each average, we show that it is sufficient to prove convergence on special factors, the Host-Kra factors, which have the structure of a nilmanifold. We also give a description of the limit. In particular, if the polynomials are independent over the real numbers then the limit is the product of the integrals. We further show that if the collection of polynomials has "low complexity", then for every set E of real numbers with positive density and for every δ > 0, the set of polynomial return times for the "δ-thickened" set Es has bounded gaps. We give bounds for the flow average complexity and show that in some cases the flow average complexity is strictly less than the discrete average complexity.
机译:我们显示了在多项式的返回时间处评估的函数乘积的连续时间遍历平均值的L〜2收敛性。这些平均值是Furstenberg证明Sze-meredi定理的平均值的连续时间版本。对于每个平均值,我们证明足以证明在特殊因素上具有收敛性的Host-Kra因子具有收敛性。我们还给出了限制的说明。特别是,如果多项式在实数上是独立的,则极限是积分的乘积。我们进一步表明,如果多项式的集合具有“低复杂度”,则对于每个具有正密度的实数集E以及对于每个δ> 0,“加厚δ”集Es的多项式返回时间都将受到限制差距。我们给出了流量平均复杂度的界限,并表明在某些情况下,流量平均复杂度严格小于离散平均复杂度。

著录项

  • 来源
    《Illinois Journal of Mathematics》 |2011年第2期|589-621|共33页
  • 作者

    AMANDA POTTS;

  • 作者单位

    Department of Mathematics, Northwestern University, 2033 Sheridan Road, Evanston, IL 60208-2730, USA;

  • 收录信息 美国《科学引文索引》(SCI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号