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

特殊类型多项式计数方法综述

Survey on counting special types of polynomials

Joachim von zur Gathen, Konstantin Ziegler

摘要:

有限域上的大多数整数是复合的,大多数一元多项式是可约的。素数定理和Gaussel的一个经典结果近似而精确地计算了其余的素数.对于两个或多个变量的多项式,情况发生了戏剧性的变化。大多数多元多项式是不可约的。本文给出了有限域上某些特殊类型的多元多项式的计数结果,即可约多项式、s-幂次多项式(可被非常数多项式的s次幂整除)、相对不可约多项式(不可约但在扩域上可约)、可分解多项式以及可约空间曲线的计数结果。这些都是精确的公式和具有相对误差的近似值,这些近似值在输入大小上基本上呈指数级下降。此外,如果对某些非线性多项式g和h,f = g o h,则一元多项式f是可分解的。直观上很清楚,可分解的多项式在所有多项式中只占少数。驯服的情况下,Fq的特征p不划分n = deg F,是相当好理解的,我们得到密切匹配的上限和下界的可分解多项式的数量。在p确实能整除n的情况下,边界就不那么令人满意了,特别是当p是n的最小素除子并且能整除n两次的时候。问题的关键是计算碰撞的次数,其中本质上不同的(g,h)产生相同的f。我们给出了所有n = p^2次碰撞的分类,它给出了这些可分解多项式的精确计数。

英文摘要:

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gauß count the remaining ones, approximately and exactly. For polynomials in two or more variables, the situation changes dramatically. Most multivariate polynomials are irreducible. This survey presents counting results for some special classes of multivariate polynomials over a finite field, namely the the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), the relatively irreducible ones (irreducible but reducible over an extension field), the decomposable ones, and also for reducible space curves. These come as exact formulas and as approximations with relative errors that essentially decrease exponentially in the input size. Furthermore, a univariate polynomial f is decomposable if f = g o h for some nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials. The tame case, where the characteristic p of Fq does not divide n = deg f, is fairly well-understood, and we obtain closely matching upper and lower bounds on the number of decomposable polynomials. In the wild case, where p does divide n, the bounds are less satisfactory, in particular when p is the smallest prime divisor of n and divides n exactly twice. The crux of the matter is to count the number of collisions, where essentially different (g, h) yield the same f. We present a classification of all collisions at degree n = p^2 which yields an exact count of those decomposable polynomials.

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

↑