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

广义项链的有效计数方法

Efficient Methods in Counting Generalized Necklaces

V Ch Venkaiah

摘要:

Venkaiah在2015年的[7]中表明,广义数的类别可以使用表达式\begin{equation*} e(n, q) = \frac{1}{(q-1) ord(λ) n} \sum^{ord(λ)n}_{\substack{t \in \mathbb{F}_q \setminus \{0\}, i=1 \\ t^{\frac{n}{\gcd(n, i)}} λ^{\frac{i}{\gcd(n,i)}} = 1}}(q^{\gcd(n,i)} - 1) + 1 \end{equation*}计算,其中$q$(颜色数)是素域$\mathbb{F}_q$的大小,$λ$是常数循环移位的常数,$n$是项链的长度。然而,除了$\gcd$计算之外,该表达式的直接求值需要$2*(q-1)*Ord(λ)*n$求幂和$(q-1)*Ord(λ)*n$乘法,至多$(q-1)*Ord(λ)*n$求幂和至多$2*(q-1)*Ord(λ)*n$加法,因此计算密集。本文讨论了计算表达式的各种其他方法,并试图对分摊计算量提供一些帮助。

英文摘要:

It is shown in [7] by Venkaiah in 2015 that a category of the number of generalized can be computed using the expression \begin{equation*} e(n, q) = \frac{1}{(q-1) ord(λ) n} \sum^{ord(λ)n}_{\substack{t \in \mathbb{F}_q \setminus \{0\}, i=1 \\ t^{\frac{n}{\gcd(n, i)}} λ^{\frac{i}{\gcd(n,i)}} = 1}}(q^{\gcd(n,i)} - 1) + 1 \end{equation*} where $q$ (number of colors) is the size of the prime field $\mathbb{F}_q$, $λ$ is the constant of the consta-cyclic shift, $n$ is the length of the necklace. However, direct evaluation of this expression requires, apart from the $\gcd$ computations, $2*(q-1)*Ord(λ)*n$ exponentiations and $(q-1)*Ord(λ)*n$ multiplications, at most $(q-1)*Ord(λ)*n$ exponentiations and at most $2*(q-1)*Ord(λ)*n$ additions and hence computationally intensive. This note discusses various other ways of evaluating the expression and tries to throw some light on amortizing the amount of computation.

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

↑