2000 character limit reached
Irreducibility of lacunary polynomials with 0,1 coefficients
Published 13 Oct 2024 in math.NT | (2410.10035v1)
Abstract: We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}kx{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that $\lim_{k\rightarrow\infty}\limsup_{N\rightarrow\infty}\mathbb{P}(\text{$F(x)$ is reducible})=0.$ The probability in this context is derived from the uniform count of polynomials $F(x)$ of the above form.
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.