Related papers: Some Applications of Dynamical Belyi Polynomials

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…

Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailed analysis of the structure of the directed…

We prove a low characteristic counterpart to the main result in (Peluse, 2019), establishing power saving bounds for the polynomial Szemer\'{e}di theorem for certain families of polynomials. Namely, we show that if $P_1, \dots, P_m \in…

Evaluation of low degree hypergeometric polynomials to zero defines an algebraic hypersurface in the affine space of the free parameters and the argument. This article investigates the algebraic surfaces 2F1(-N,b;c;z)=0 for N=3 and N=4. As…

We introduce a new non-degeneracy condition at infinity for a real or a mixed polynomial mapping $F$ which allows us to approximate its bifurcation locus in terms of certain Newton polyhedra. We derive a sufficiency result for the Jacobian…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

Let $f$ be a polynomial with integer coefficients such that $f(n)$ positive for any positive integer $n$. We consider diverging sequences $\{ y_n\}$ given by $y_0 = b$ and $y_{n+1} = f^{y_n}(a)$ with positive integers $a$ and $b$. We show…

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

We extend the refined version of the Chabauty-Coleman bound on the number of rational points on a curve of genus g>1 to the case of bad reduction.

We extend Sullivan's complex a priori bounds to real quadratic polynomials with essentially bounded combinatorics. Combined with the previous results of the first author, this yields complex bounds for all real quadratics. Local…

We provide an explicit method to construct dynamical systems which admit an a-priori prescribed attracting set. As application, we provide a method to construct perturbations of conservative dynamical systems, which admit an a-priori…

We provide some statistics about an irreducibility/reducibility test for multivariate polynomials over finite fields based on counting points. The test works best for polynomials in a large number of variables and can also be applied to…

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

Let $\Phi$ be an endomorphism of $\SR(\bar{\Q})$, the projective line over the algebraic closure of $\Q$, of degree $\geq2$ defined over a number field $K$. Let $v$ be a non-archimedean valuation of $K$. We say that $\Phi$ has critically…

For a positive integer $n$ let $\mathcal{X}_n$ be either the algebra $M_n$ of $n \times n$ complex matrices, the set $N_n$ of all $n \times n$ normal matrices, or any of the matrix Lie groups $\mathrm{GL}(n)$, $\mathrm{SL}(n)$ and…

Under integral restrictions on dilatations, it is proved existence theorems for the degenerate Beltrami equations with two characteristics and, in particular, to the Beltrami equations of the second type that play a great role in many…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

We resolve Stillman's conjecture for families of polynomial rings that are graded by any semigroup under mild conditions. Conversely, we show that these conditions are necessary for the existence of a Stillman bound. This has applications…