首页> 外文期刊>International Journal of Number Theory >Long unsplittable zero-sum sequences over a finite cyclic group
【24h】

Long unsplittable zero-sum sequences over a finite cyclic group

机译:有限循环群上不可分裂的长零和序列

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

摘要

Let G be an additively written finite cyclic group of order n and let S be a minimal zero-sum sequence with elements of G, i.e. the sum of elements of S is zero, but no proper nontrivial subsequence of S has sum zero. S is called unsplittable if there do not exist an element g in S and two elements x, y in G such that g = x + y and the new sequence Sg(-1) xy is still a minimal zero-sum sequence. In this paper, we investigate long unsplittable minimal zero-sum sequences over G. Our main result characterizes the structures of all such sequences S and shows that the index of S is at most 2, provided that the length of S is greater than or equal to [n/3] + 8 where n > 20,585 is a positive integer with least prime divisor greater than 13.
机译:令G为n阶的加法有限循环群,令S为元素为G的最小零和序列,即S的元素之和为零,但S的适当非平凡子序列的总和为零。如果S中不存在元素g和G中不存在两个元素x,y使得g = x + y并且新序列Sg(-1)xy仍然是最小零和序列,则S被称为不可分裂的。在本文中,我们研究了G上长的不可分裂的最小零和序列。我们的主要结果表征了所有此类序列S的结构,并表明S的索引最大为2,前提是S的长度大于或等于到[n / 3] + 8,其中n> 20,585是一个最小整数除以13的正整数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号