Related papers: Arithmetic of Unicritical Polynomial Maps

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…

We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case…

Assume that there exists a smooth map between two closed manifolds $M^m\to N^k$ with only finitely many cone-like singular points, where $2\leq k\leq m\leq 2k-1$. If $(m,k)\not\in\{(2,2), (4,3), (5,3), (8,5), (16,9)\}$, then $M^m$ admits a…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

In this paper, we show that for a unicritical polynomial having a priori bounds, the unique conformal measure of minimal exponent has no atom at the critical point. For a conformal measure of higher exponent, we give a necessary and…

We determine a necessary and sufficient condition for a polynomial over an algebraically closed field $k$ to induce a surjective map on matrix algebras $M_n(k)$ for $n \ge 2$. The criterion is given in terms of critical points and uses…

Inou and Shishikura provided a class of maps that is invariant by near-parabolic renormalization, and that has proved extremely useful in the study of the dynamics of quadratic polynomials. We provide here another construction, using more…

We discuss tangent maps related to the multipliers of periodic points of a typical one-dimensional polynomial map.

We prove a theorem on distortion of cross ratio of four points under the mapping effected by a complex polynomial with restricted critical values. Its corollaries include inequalities involving the absolute value and certain coefficients of…

We consider support points of the class $S^0(\mathbb{D}^n)$ of normalized univalent mappings on the polydisc $\mathbb{D}^n$ with parametric representation and we prove sharp estimates for coefficients of degree 2.

We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of distinct monomials for dimensions 2 and 3. We study the connection with monomial CR maps of hyperquadrics and prove similar bounds in this setup…

The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite…

We consider an extremal problem for polynomials, which is dual to the well-known Smale mean value problem. We give a rough estimate depending only on the degree.

We compute the degree complexity of the family of birational maps considered in \cite{bedford-kim-tuyen-abarenkova-maillard} for all exceptional cases. Some interesting properties of the family are also given.

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.

We study the set of critical points of a solution to $\Delta u = \lambda \cdot u$ and in particular components of the critical set that have codimension 1. We show, for example, that if a second Neumann eigenfunction of a simply connected…

We build a class of polynomial problems with not polynomial certificates. The parameter concerning which are defined efficiency of corresponding algorithms is the number $n$ of elements of the set has used at construction of combinatory…

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…