Counting decomposable multivariate polynomials

被引:0
|
作者
Joachim von zur Gathen
机构
[1] B-IT,
[2] Universität Bonn,undefined
关键词
Computer algebra; Polynomial decomposition; Multivariate polynomials; Finite fields; Combinatorics on polynomials;
D O I
暂无
中图分类号
学科分类号
摘要
A polynomial f (multivariate over a field) is decomposable if \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${f=g \circ h}$$\end{document} with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number over a finite field. The relative error in our approximations is exponentially decaying in the input size.
引用
收藏
页码:165 / 185
页数:20
相关论文
共 50 条