arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.14219math.NT
收藏

平方Frobenius数

The Square Frobenius Number

Jonathan Chappelon, Jorge Luis Ramírez Alfonsín

摘要:

设$S=\left\langle s_1,\ldots,s_n\right\rangle$是由互质正整数$s_1,\ldots,s_n$生成的数值半群.令$k\geqslant 2$为整数。本文考虑$S$的Frobenius数的下列$k$ -幂变式定义为$${}^{k\!}r\!\left(S\right):= \text{ the largest } k \text{-power integer not belonging to } S.$$。给出了由{ \em算术级数}生成的无限半群族$S_A$的${}^{2\!}r\!\left(S_A\right)$的一个上界.在某些条件下,后者是${}^{2\!}r\!\left(\left\langle s_1,s_2\right\rangle\right)$的精确值。当$d=3,4$和$5$时,给出了${}^{2\!}r\!\left(\left\langle s_1,s_1+d \right\rangle\right)$的精确公式,研究了${}^{2\!}r\!\left(\left\langle s_1,s_1+1 \right\rangle\right)$和${}^{2\!}r\!\left(\left\langle s_1,s_1+2 \right\rangle\right)$,并给出了两个相应的公式。最后讨论了相关问题。

英文摘要:

Let $S=\left\langle s_1,\ldots,s_n\right\rangle$ be a numerical semigroup generated by the relatively prime positive integers $s_1,\ldots,s_n$. Let $k\geqslant 2$ be an integer. In this paper, we consider the following $k$-power variant of the Frobenius number of $S$ defined as $${}^{k\!}r\!\left(S\right):= \text{ the largest } k \text{-power integer not belonging to } S.$$In this paper, we investigate the case $k=2$. We give an upper bound for ${}^{2\!}r\!\left(S_A\right)$ for an infinite family of semigroups $S_A$ generated by {\em arithmetic progressions}. The latter turns out to be the exact value of ${}^{2\!}r\!\left(\left\langle s_1,s_2\right\rangle\right)$ under certain conditions. We present an exact formula for ${}^{2\!}r\!\left(\left\langle s_1,s_1+d \right\rangle\right)$ when $d=3,4$ and $5$, study ${}^{2\!}r\!\left(\left\langle s_1,s_1+1 \right\rangle\right)$ and ${}^{2\!}r\!\left(\left\langle s_1,s_1+2 \right\rangle\right)$ and put forward two relevant conjectures. We finally discuss some related questions.

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

↑