arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.09497math.COmath.NT
收藏

弱连续序列

Weakly Consecutive Sequences

Thomas Garrison, Chris Seiler, Andrew Knowles

AI总结:

研究弱连续序列的结构和计数问题,提出四种起始序列和三种规则生成新序列,推测所有序列均可由规则生成,分析规则得计数上界。

摘要:

弱连续序列(WCS)是{1,…,k}的排列σ,使得若整数d整除σ(i),则d也整除σ(i±d)(若定义)。WCS结构丰富,难以求出长度为k的WCS数目N(k)的公式。但对给定k,描述四种起始序列,通过三种规则生成新序列。推测所有WCS均可由规则生成,规则依赖于k及周边整数的素性。通过分析规则得出N(k)的上界。

英文摘要:

A weakly consecutive sequence (WCS) is a permutation $σ$ of $\{1, \ldots, k\}$ such that if an integer $d$ divides $σ(i)$, then $d$ also divides $σ(i \pm d)$ insofar as these are defined. The structure of weakly consecutive sequences is surprisingly rich, and it is difficult to find a formula for the number $N(k)$ of WCS's of length $k$. However, for a given $k$ we describe four starting sequences, to each of which we can apply three \emph{rules} or operations to generate new WCS's. We conjecture that any WCS can be constructed by applying these rules, which depend in an intricate way on the primality of $k$ and surrounding integers. We find bounds for $N(k)$ by analyzing these rules.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑