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


Some irreducibility and indecomposability results for truncated binomial polynomials of small degree
Authors:ARTŪRAS DUBICKAS  JONAS ŠIURYS
Institution:1.Department of Mathematics and Informatics,Vilnius University,Vilnius,Lithuania
Abstract:In this paper, we show that the truncated binomial polynomials defined by \(P_{n,k}(x)={\sum }_{j=0}^{k} {n \choose j} x^{j}\) are irreducible for each k≤6 and every nk+2. Under the same assumption nk+2, we also show that the polynomial P n,k cannot be expressed as a composition P n,k (x) = g(h(x)) with \(g \in \mathbb {Q}x]\) of degree at least 2 and a quadratic polynomial \(h \in \mathbb {Q}x]\). Finally, we show that for k≥2 and m,nk+1 the roots of the polynomial P m,k cannot be obtained from the roots of P n,k , where mn, by a linear map.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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