Related papers: Dynamically distinguishing polynomials

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,…

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

We estimate several probability distributions arising from the study of random, monic polynomials of degree $n$ with coefficients in the integers of a general $p$-adic field $K_{\mathfrak{p}}$ having residue field with $q= p^f$ elements. We…

Let d>2 and let p be a prime coprime to d. Let Z_pbar be the ring of integers of Q_pbar. Suppose f(x) is a degree-d polynomial over Qbar and Z_pbar. Let P be a prime ideal over p in the ring of integers of Q(f), where Q(f) is the number…

Let $p\geq 5$ be a prime. We construct modular Galois representations for which the $\mathbb{Z}_p$-corank of the $p$-primary Selmer group (i.e., $\lambda$-invariant) over the cyclotomic $\mathbb{Z}_p$-extension is large. More precisely, for…

In this paper, we show that various kinds of integer polynomials with prescribed properties of their roots have positive density. For example, we prove that almost all integer polynomials have exactly one or two roots with maximal modulus.…

We study the distribution of the sequence of elements of the discrete dynamical system generated by iterations of the M\"obius map $x \mapsto (ax + b)/(cx+d)$ over a finite field of $p$ elements at the moments of time that correspond to…

We define a necessary and sufficient condition on a polynomial $h\in \mathbb{Z}[x]$ to guarantee that every set of natural numbers of positive upper density contains a nonzero difference of the form $h(p)$ for some prime $p$. Moreover, we…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

In this paper we introduce a new method for finding Galois groups by computer. This is particularly effective in the case of Galois groups of p-extensions ramified at finitely many primes but unramified at the primes above p. Such Galois…

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

For finitely generated subgroups $W_1, \ldots , W_t$ of $\mathbb{Q}^{\times}$, integers $k_1, \ldots , k_t$, a Galois extension $F$ of $\mathbb{Q}$ and a union of conjugacy classes $C \subset \text{Gal}(F/\mathbb{Q})$, we develop methods…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We introduce a new technique to prove connectivity of subsets of covering spaces (so called inductive connectivity), and apply it to Galois theory of problems of enumerative geometry. As a model example, consider the problem of permuting…

Dynamical systems---by which we mean machines that take time-varying input, change their state, and produce output---can be wired together to form more complex systems. Previous work has shown how to allow collections of machines to…

For a graph $G$ and an integer-valued threshold function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbors in it eventually…

We study the dynamic structures of the monomial $x^m$ over the ring of $p$-adic integers for every positive integer $m$ and for primes $p=2,3$ and $5$. The dynamic structures are described by investigating minimal decompositions which…

For every nonconstant polynomial $f\in\mathbb Q[x]$, let $\Phi_{4,f}$ denote the fourth dynatomic polynomial of $f$. We determine here the structure of the Galois group and the degrees of the irreducible factors of $\Phi_{4,f}$ for every…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…