Related papers: Arithmetic of Unicritical Polynomial Maps

We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.

We study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one…

We establish a one-to-one correspondence between 1-planar graphs and general and hole-free 4-map graphs and show that 1-planar graphs can be recognized in polynomial time if they are crossing-augmented, fully triangulated, and maximal…

Over an algebraically closed field of positive characteristic, there exist rational functions with only one critical point. We give an elementary characterization of these functions in terms of their continued fraction expansions. Then we…

We study the number of meromorphic functions on a Riemann surface with given critical values and prescribed multiplicities of critical points and values. When the Riemann surface is $\CP^1$ and the function is a polynomial, we give an…

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

In the last years a lot of work has been concentrated on the study of the behaviour at infinity of polynomial maps. This behaviour can be very complicated, therefore the main idea was to find special classes of polynomial maps which have,…

The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…

We study the topology of the real algebraic hypersurfaces in $\mathbb{P}^n$ that can be constructed via combinatorial patchworking using triangulations that are dilations by two of other triangulations. By examining the real critical points…

A real polynomial $p$ of degree $n$ is called a Morse polynomial if its derivative has $n-1$ pairwise differentreal roots and values of $p$ in these roots (critical values) are also pairwise different. The plot of such polynomial is called…

We study the correspondence between unicritical laminations and maximally critical laminations with rotational and identity return polygons. Laminations are a combinatorial and topological way to study Julia sets. Laminations give…

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

Let $p_n$ be a random, degree $n$ polynomial whose roots are chosen independently according to the probability measure $\mu$ on the complex plane. For a deterministic point $\xi$ lying outside the support of $\mu$, we show that almost…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…