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

关于整数分拆与连分数型算法

On integer partitions and continued fraction type algorithms

Wael Baalbaki, Claudio Bonanno, Alessio Del Vigna, Thomas Garrity, Stefano Isola

摘要:

我们发现,添加剂,慢,法瑞版本的传统的连分数算法有一个自然的解释,作为一种方法,生产整数分区的正数$n$成两个较小的数字,与多重性。我们提供了一个完整的描述如何发生这样的整数分区和共轭相应的年轻的形状通过经典的Farey树的动态。利用Farey映射的动力学性质得到了一个新的$p(2,n)$公式,它表示将$n$划分为两个更小的正整数的方法的个数,且具有多重性.然后,我们使用三角形映射(一种多维连分数算法)的加法-慢速-Farey版本进行模拟,给出了一种将正数$n$整数分割为三个更小的数的方法,并具有多重性。然而,这种普遍化的不同方面仍然不清楚。

英文摘要:

We show that the additive-slow-Farey version of the traditional continued fractions algorithm has a natural interpretation as a method for producing integer partitions of a positive number $n$ into two smaller numbers, with multiplicity. We provide a complete description of how such integer partitions occur and of the conjugation for the corresponding Young shapes via the dynamics of the classical Farey tree. We use the dynamics of the Farey map to get a new formula for $p(2,n)$, the number of ways for partitioning $n$ into two smaller positive integers, with multiplicity. We then do the analogue using the additive-slow-Farey version of the Triangle map (a type of multi-dimensional continued fraction algorithm), giving us a method for producing integer partitions of a positive number $n$ into three smaller numbers, with multiplicity. However different aspects of this generalisations remain unclear.

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

↑