# On the set of stable primes for postcritically infinite maps over number fields

Source: [On the set of stable primes for postcritically infinite maps over number fields](<https://www.sota2.com/research/paper/68fa5e6e1e209131ce9e23db>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T18:47:46.339Z

Authors: Joachim K\\"onig

Published: 2024-08-24T05:31:54.000Z

## Abstract

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and, more generally, rational functions over number fields), the set of stable primes, i.e., primes modulo which all iterates of $f$ are irreducible, is a density zero set. Compared to previous results, our families cover a much wider ground, and in particular apply to $100\\%$ of polynomials of any given odd degree, thus adding evidence to the conjecture that polynomials with a "large" set of stable primes are necessarily of a very specific shape, and in particular are necessarily postcritically finite.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2408.13477>)

[PDF](<https://arxiv.org/pdf/2408.13477.pdf>)
