Related papers: On postcritically finite polynomials, part 1: crit…
We study the forward orbit of the critical point for polynomials of the form $f_c=z^2+c$ defined over $\mathbb{Z}_p$. Hubbard trees capture the dynamical behavior for such maps with finite critical orbit in $\mathbb{C}$. We suggest a notion…
We establish the equidistribution with respect to the bifurcation measure of post-critically finite maps in any one-dimensional algebraic family of unicritical polynomials. Using this equidistribution result, together with a combinatorial…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
In the last years the attention towards topological dynamical properties of highly discontinuous maps has increased significantly. In [D.Corona, A. Della Corte. The critical exponent functions. Comptes Rendus Math\'ematique, 360(G4),…
We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…
The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…
We examine affine correspondences of the form g(y)=f(x), for f and g polynomials satisfying deg(g) < deg(f), with the property that every critical point of the correspondence admits at least one finite forward orbit. In the case g(y)=y,…
We study plane quadratic and cubic differential systems satisfying the Caushy - Riemann conditions. We construct all global topologically equivalent phase portraits of the systems.
In this paper, we consider multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomials is defined in terms of a deletion-contraction-extraction recurrence, previously…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We obtain a unique, canonical one-to-one correspondence between the space of marked postcritically finite Newton maps of polynomials and the space of postcritically minimal Newton maps of entire maps that take the form $p(z)…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
In recent years, there has been significant progress in the understanding of the dynamics of transcendental entire functions with bounded postsingular set. In particular, for certain classes of such functions, a complete description of…
In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such…
We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…
We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…
Let $K$ be a function field of characteristic $p\geq0$ or a number field over which the $abc$ conjecture holds, and let $\phi(x)=x^d+c \in K[x]$ be a unicritical polynomial of degree $d\geq2$ with $d \not\equiv 0,1\pmod{p}$. We completely…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
We consider the family of dynamical modular curves associated to quadratic polynomial maps and determine precisely which of these curves have infinitely many cubic points. We use this to prove a classification statement on preperiodic…
Among all the dynamical modular curves associated to quadratic polynomial maps, we determine which curves have infinitely many quadratic points. This yields a classification statement on preperiodic points for quadratic polynomials over…