Maximizing Core Entropy

2026/07/16 by Jacob Kewarth
#math.DS

paper · pdf

Abstract

Here we study the core entropy function h: PM(d) → ℝ defined on the space of degree d primitive majors, a combinatorial model for the space of degree d polynomials. In particular, we introduce techniques to classify the global maximum for each d and the maxima along certain strata. We show that there are d-1 global maxima over all of PM(d) and that the maxima on the unicritical stratum is a Cantor set.

Related

• The core entropy for polynomials of higher degree
• Core entropy of quadratic polymonials
• On thurston's core entropy algorithm dedicated to the memory of tan lei
• Continuity of core entropy of quadratic polynomials
• Degree-d-invariant laminations