arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.07784cs.DScs.CCcs.SCmath.RA
收藏

计算整数关系格子的赫尔米特正交基

Computing bases in Hermite normal form of lattices of integer relations

Cheriton School of Computer Science, University of Waterloo(滑铁卢大学 Cheriton 计算机科学学院)

George Labahn, Arne Storjohann

AI总结:

本文提出一种随机化算法,用于计算由整数关系生成的格子的赫尔米特正交基,当M为方阵且F为单位矩阵时,算法能计算M的赫尔米特正交基,其运算复杂度与矩阵乘法相当。

摘要:

给定一个满列秩的M∈Z^{ℓ×m}和一个F∈Z^{n×m},本文提出一种算法来计算由所有满足pF∈Z^{1×m}的行p∈Z^{1×n}构成的整数格子的n×n赫尔米特基。该算法是拉斯维加斯类型的随机算法,失败概率不超过1/2,但若未失败则保证输出正确结果。当M为方阵且F=I_m时,计算的基是M的赫尔米特正交基,其所需位运算次数与乘两个相同维度和元素大小的矩阵相当。

英文摘要:

Given a full column rank $M \in \Z^{\ell \times m}$ and an $F \in \Z^{n \times m}$ we present an algorithm to compute the $n \times n$ basis in Hermite form of the integer lattice comprised of all rows $p \in \Z^{1 \times n}$ such that $pF \in \Z^{1 \times m}$ is in the integer lattice generated by the rows of $M$. The algorithm is randomized of the Las Vegas type, that is, it can fail with probability at most $1/2$, but if fail is not returned it guarantees to produce the correct result. When $M$ is square and $F=I_m$, then the computed basis is the Hermite normal form of $M$, and the algorithm uses about the same number of bit operations as required to multiply together two matrices of the same dimension and size of entries as $M$.

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

↑