English
Related papers

Related papers: Integrality and Thurston Rigidity for Bicritical P…

200 papers

In this article, we derive lower bounds for the number of distinct prime divisors of families of non-zero Fourier coefficients of non-CM primitive cusp forms and more generally of non-CM primitive Hilbert cusp forms. In particular, for the…

Number Theory · Mathematics 2024-02-14 Sunil L Naik

We prove the No Invariant Line Fields conjecture for a class of generalized postcritically-finite branched covers on higher-dimensional Riemannian manifolds. Moreover, we establish a quasisymmetric uniformization theorem for this class of…

Dynamical Systems · Mathematics 2025-12-16 Zhiqiang Li , Pekka Pankka , Hanyun Zheng

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh

We obtain an analogue of the prime number theorem for a class of branched covering maps on the $2$-sphere called expanding Thurston maps $f$, which are topological models of some rational maps without any smoothness or holomorphicity…

Dynamical Systems · Mathematics 2018-04-24 Zhiqiang Li , Tianyi Zheng

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

Number Theory · Mathematics 2024-09-17 Tori Day , Rebecca DeLand , Jamie Juul , Cigole Thomas , Bianca Thompson , Bella Tobin

We study Diophantine equations of type f(x)=g(y), where both f and g have at least two distinct critical points and equal critical values at at most two distinct critical points. Some classical families of polynomials (f_n)_n are such that…

Number Theory · Mathematics 2016-01-28 Dijana Kreso , Robert F. Tichy

We prove a rigidity theorem for the Poisson automorphisms of the function fields of tori with quadratic Poisson structures over fields of characteristic 0. It gives an effective method for classifying the full Poisson automorphism groups of…

Rings and Algebras · Mathematics 2016-09-23 Jesse Levitt , Milen Yakimov

Thurston parameterized quadratic invariant laminations with a non-invariant lamination, the quotient of which yields a combinatorial model for the Mandelbrot set. As a step toward generalizing this construction to cubic polynomials, we…

Dynamical Systems · Mathematics 2022-01-28 Alexander Blokh , Lex Oversteegen , Ross Ptacek , Vladlen Timorin

We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…

Algebraic Geometry · Mathematics 2015-01-14 Martin Weimann

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…

Computational Complexity · Computer Science 2018-12-18 Peter Bürgisser

For a class of polynomial non-autonomous differential equations of degree n, we use phase plane analysis to show that each equation in this class has n periodic solutions. The result implies that certain rigid two-dimensional systems have…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. A. M. Alwash

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

Computational Complexity · Computer Science 2018-03-19 Chi-Ning Chou , Mrinal Kumar , Noam Solomon

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Dynamical Systems · Mathematics 2022-12-02 Kan Jiang

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

The bicategory of parameterized spectra has a remarkably rich structure. In particular, it is possible to take traces in this bicategory, which give classical invariants that count fixed points. We can also take equivariant traces, which…

Algebraic Topology · Mathematics 2023-06-07 Cary Malkiewich , Kate Ponto

For perturbations of integrable Hamiltonians systems, the Nekhoroshev theorem shows that all solutions are stable for an exponentially long interval of time, provided the integrable part satisfies a steepness condition and the system is…

Dynamical Systems · Mathematics 2015-05-20 Abed Bounemoura

An orientation-preserving branched covering map $f\colon S^2 \to S^2$ is called a critically fixed Thurston map if $f$ fixes each of its critical points. It was recently shown that there is an explicit one-to-one correspondence between…

Dynamical Systems · Mathematics 2026-01-28 Mikhail Hlushchanka , Nikolai Prochorov

We give a complete description of the normal subgroups of arboreal Galois groups of Belyi maps. The normal groups form a unique chief series. We also carefully compute the discriminate of the iterate of a polynomial minus an algebraic…

Number Theory · Mathematics 2020-10-13 Wayne Peng

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

Number Theory · Mathematics 2025-01-10 Olivier Ramaré