首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the number of reducible polynomials of bounded naive height
Authors:Artūras Dubickas
Institution:1. Department of Mathematics and Informatics, Vilnius University, Naugarduko 24, 03225, Vilnius, Lithuania
2. Institute of Mathematics and Informatics, Vilnius University, Akademijos 4, 08663, Vilnius, Lithuania
Abstract:We prove an asymptotical formula for the number of reducible integer polynomials of degree d and of naive height at most T when \({T \to \infty}\) . The main term turns out to be of the form \({\kappa_d T^d}\) for each \({d \geq 3}\) , where the constant \({\kappa_d}\) is given in terms of some infinite Dirichlet series involving the volumes of symmetric convex bodies in \({\mathbb{R}^d}\) . For d = 2, we prove that there are asymptotically \({\kappa_2 T^2 \,\text{log} T}\) of such polynomials, where \({\kappa_2:=6(3\sqrt{5}+2\,\text{log} (1+\sqrt{5}) -2 \,\text{log}\, 2)/\pi^2}\) . Earlier results in this direction were given by van der Waerden, Pólya and Szegö, Dörge, Chela, and Kuba.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号