Irreducibility of polynomials with random multiplicative coefficients revisited

Abstract

We show that for a random polynomial \[ F(X) = Σn=1N f(n) Xn-1, \] where f(n) is a random completely multiplicative function taking values in \ 1\, one has \[ N ∞ P[F(X) is irreducible] = 1. \]

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…