We study the dynamics of the unicritical polynomial family [Formula: see text]. The [Formula: see text]-values for which [Formula: see text] has a strictly preperiodic postcritical orbit are called Misiurewicz parameters, and they are the roots of Misiurewicz polynomials. The arithmetic properties of these special parameters have found applications in both arithmetic and complex dynamics. In this paper, we investigate some new such properties. In particular, when [Formula: see text] is a prime power and [Formula: see text] is a Misiurewicz parameter, we prove certain arithmetic relations between the points in the postcritical orbit of [Formula: see text]. We also consider the algebraic integers obtained by evaluating a Misiurewicz polynomial at a different Misiurewicz parameter, and we ask when these algebraic integers are algebraic units. This question naturally arises from some results recently proven by Buff, Epstein, and Koch and by the second author. We propose a conjectural answer to this question, which we prove in many cases.
- Award ID(s):
- 1711488
- PAR ID:
- 10182925
- Date Published:
- Journal Name:
- Communications in Contemporary Mathematics
- Volume:
- 22
- Issue:
- 03
- ISSN:
- 0219-1997
- Page Range / eLocation ID:
- 1950016
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In [M. De Renzi, A. Gainutdinov, N. Geer, B. Patureau-Mirand and I. Runkel, 3-dimensional TQFTs from non-semisimple modular categories, preprint (2019), arXiv:1912.02063[math.GT]], we constructed 3-dimensional topological quantum field theories (TQFTs) using not necessarily semisimple modular categories. Here, we study projective representations of mapping class groups of surfaces defined by these TQFTs, and we express the action of a set of generators through the algebraic data of the underlying modular category [Formula: see text]. This allows us to prove that the projective representations induced from the non-semisimple TQFTs of the above reference are equivalent to those obtained by Lyubashenko via generators and relations in [V. Lyubashenko, Invariants of 3-manifolds and projective representations of mapping class groups via quantum groups at roots of unity, Comm. Math. Phys. 172(3) (1995) 467–516, arXiv:hep-th/9405167]. Finally, we show that, when [Formula: see text] is the category of finite-dimensional representations of the small quantum group of [Formula: see text], the action of all Dehn twists for surfaces without marked points has infinite order.
-
Motivated by results about “untangling” closed curves on hyperbolic surfaces, Gupta and Kapovich introduced the primitivity and simplicity index functions for finitely generated free groups, [Formula: see text] and [Formula: see text], where [Formula: see text], and obtained some upper and lower bounds for these functions. In this paper, we study the behavior of the sequence [Formula: see text] as [Formula: see text]. Answering a question from [17], we prove that this sequence is unbounded and that for [Formula: see text], we have [Formula: see text]. By contrast, we show that for all [Formula: see text], one has [Formula: see text]. In addition to topological and group-theoretic arguments, number-theoretic considerations, particularly the use of asymptotic properties of the second Chebyshev function, turn out to play a key role in the proofs.more » « less
-
Let [Formula: see text] be a Baumslag–Solitar group and let [Formula: see text] be a complex reductive algebraic group with maximal compact subgroup [Formula: see text]. We show that, when [Formula: see text] and [Formula: see text] are relatively prime with distinct absolute values, there is a strong deformation retraction of [Formula: see text] onto [Formula: see text].more » « less
-
Computing the Fréchet distance between two polygonal curves takes roughly quadratic time. In this paper, we show that for a special class of curves the Fréchet distance computations become easier. Let [Formula: see text] and [Formula: see text] be two polygonal curves in [Formula: see text] with [Formula: see text] and [Formula: see text] vertices, respectively. We prove four results for the case when all edges of both curves are long compared to the Fréchet distance between them: (1) a linear-time algorithm for deciding the Fréchet distance between two curves, (2) an algorithm that computes the Fréchet distance in [Formula: see text] time, (3) a linear-time [Formula: see text]-approximation algorithm, and (4) a data structure that supports [Formula: see text]-time decision queries, where [Formula: see text] is the number of vertices of the query curve and [Formula: see text] the number of vertices of the preprocessed curve.more » « less