Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.11482

A Genetic Algorithm for Generating Extreme Examples in Arithmetic Dynamics

Benjamin Hutz
View original source ↗Read source document ↗Export metadata ↓

Abstract

We describe a genetic algorithm to find extreme examples in the arithmetic of dynamical systems. The algorithm is applied to four problems: small (non-zero) canonical heights, many rational preperiodic points, long rational cycles, and long rational tails. Data is provided for extreme examples generated for polynomials up to degree 13 and rational functions up to degree 5. This work significantly expands the known examples of extreme behavior for several of the conjectured behaviors in arithmetic dynamics and provides a foundation from which to begin a more advanced application of machine learning techniques in the creation of extreme examples for arithmetic dynamics.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Hutz. 2026-05-05. A Genetic Algorithm for Generating Extreme Examples in Arithmetic Dynamics. https://arxiv.org/abs/2601.11482

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗
arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗
arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗