【24h】

Quasirandom permutations

机译:拟随机排列

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

摘要

Chung and Graham (J. Combin. Theory Ser. A 61 (1992) 64) define quasirandom subsets of ,, to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of Z(11) epsilon-balanced if its discrepancy on each interval is bounded by en. A quasirandom permutation, then, is one which maps each interval to a highly balanced set. In the spirit of previous studies of quasi randomness, we exhibit several random-like properties which are equivalent to this one, including the property of containing (approximately) the expected number of subsequences of each order-type. We present a construction for a family of strongly quasirandom permutations, and prove that this construction is essentially optimal, using a result of Schmidt on the discrepancy of sequences of real numbers. (C) 2004 Elsevier Inc. All rights reserved.
机译:Chung和Graham(J. Combin。Theory Ser。A 61(1992)64)将的准随机子集定义为具有大量等效随机类属性集合中的任何一个的子集。如果它们在每个间隔上的差异受en限制,我们将削弱它们的定义,并称Z(11)epsilon-balanced的子集。因此,准随机排列是将每个间隔映射到高度平衡的集合的排列。本着先前研究的准随机性的精神,我们展示了几种与之类似的随机性,包括包含(大约)每种顺序类型的预期子序列数的属性。我们提出了一个针对强拟随机排列族的构造,并证明了该构造实际上是最佳的,使用了施密特关于实数序列差异的结果。 (C)2004 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号