2000 character limit reached
Some irreducibility results for truncated binomial expansions
Published 4 Jun 2013 in math.NT | (1306.0758v1)
Abstract: For positive integers $n>k$, let $P_{n,k}(x)=\displaystyle\sum_{j=0}k \binom{n}{j}xj $ be the polynomial obtained by truncating the binomial expansion of $(1+x)n$ at the $k{th}$ stage. These polynomials arose in the investigation of Schubert calculus in Grassmannians. In this paper, the authors prove the irreducibility of $P_{n,k}(x)$ over the field of rational numbers when $2\leqslant 2k \leqslant n<(k+1)3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.