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

非格自相似弦的复维数拟周期模式,基于LLL算法

Quasiperiodic patterns of the complex dimensions of nonlattice self-similar strings, via the LLL algorithm

Michel L. Lapidus, Machiel van Frankenhuijsen, Edward K. Voskanian

AI总结:

本文利用LSA算法和MPSolve求解器,结合LLL算法生成联立丢番图逼近,更强大地展示了非格自相似分形弦复维数的拟周期模式。

摘要:

M. L. Lapidus 和 M. van Frankenhuijsen 的格弦近似算法(LSA 算法)是一种通过格自相似分形弦的复维数来近似非格自相似分形弦的复维数的方法。该方法的含义是非格弦的复维数集合具有拟周期模式。利用 LSA 算法,结合由 D. A. Bini、G. Fiorentino 和 L. Robol 提出的多精度多项式求解器 MPSolve,我们给出了非格自相似分形弦复维数集合的拟周期模式的一个新的且显著更强大的展示。该算法的实现需要一种生成联立丢番图逼近的实用方法,在某些情况下我们可以通过连分数过程来完成。否则,正如 Lapidus 和 van Frankenhuijsen 所建议的,我们使用 A. K. Lenstra、H. W. Lenstra 和 L. Lovász 的 LLL 算法。

英文摘要:

The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a lattice self-similar fractal string. The implication of this procedure is that the set of complex dimensions of a nonlattice string has a quasiperiodic pattern. Using the LSA algorithm, together with the multiprecision polynomial solver MPSolve which is due to D. A. Bini, G. Fiorentino and L. Robol, we give a new and significantly more powerful presentation of the quasiperiodic patterns of the sets of complex dimensions of nonlattice self-similar fractal strings. The implementation of this algorithm requires a practical method for generating simultaneous Diophantine approximations, which in some cases we can accomplish by the continued fraction process. Otherwise, as was suggested by Lapidus and van Frankenhuijsen, we use the LLL algorithm of A. K. Lenstra, H. W. Lenstra, and L. Lovász.

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

↑