English
Related papers

Related papers: Integrality and Thurston Rigidity for Bicritical P…

200 papers

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

Complex Variables · Mathematics 2025-02-11 Pratap Basak , Sanjay Mallick

A diffeomorphism f has a heterodimensional cycle if it displays two (transitive) hyperbolic sets K and K' with different indices such that the unstable set of K intersects the stable one of K' and vice versa. We prove that it is possible to…

Dynamical Systems · Mathematics 2025-01-15 Sébastien Biebler

Given a function field $K$ and $\phi \in K[x]$, we study two finiteness questions related to iteration of $\phi$: whether all but finitely many terms of an orbit of $\phi$ must possess a primitive prime divisor, and whether the Galois…

Number Theory · Mathematics 2017-10-13 Wade Hindes , Rafe Jones

It is well known that two-dimensional fermionic systems with a nonzero Chern number must break the time reversal symmetry, manifested by the appearance of chiral edge modes on an open boundary. Such an incompatibility between topology and…

Strongly Correlated Electrons · Physics 2023-12-05 Shang-Qiang Ning , Yang Qi , Zheng-Cheng Gu , Chenjie Wang

A free-by-cyclic group $F_N\rtimes_\phi\mathbb{Z}$ has non-trivial centre if and only if $[\phi]$ has finite order in ${\rm{Out}}(F_N)$. We establish a profinite ridigity result for such groups: if $\Gamma_1$ is a free-by-cyclic group with…

Group Theory · Mathematics 2025-07-22 Martin R. Bridson , Paweł Piwek

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

Systems and Control · Electrical Eng. & Systems 2026-04-02 Neelay Junnarkar , Peter Seiler , Murat Arcak

We study the computational complexity of multi-stage robust optimization problems. Such problems are formulated with alternating min/max quantifiers and therefore naturally fall into a higher stage of the polynomial hierarchy. Despite this,…

Optimization and Control · Mathematics 2023-03-23 Marc Goerigk , Stefan Lendl , Lasse Wulf

Let $f:\mathbb{A}^N\to\mathbb{A}^N$ be a regular endomorphism of algebraic degree $d\geq2$ (i.e., $f$ extends to an endomorphism on $\mathbb{P}^N$ of algebraic degree $d$) defined over a number field. We prove that if the set of cyclotomic…

Dynamical Systems · Mathematics 2026-01-21 Zhuchao Ji , Junyi Xie , Geng-Rui Zhang

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

Dynamical Systems · Mathematics 2009-09-25 Alfredo Poirier

We study integral points on varieties with infinite \'etale fundamental groups. More precisely, for a number field $F$ and $X/F$ a smooth projective variety, we prove that for any geometrically Galois cover $\varphi\colon Y \to X$ of degree…

Number Theory · Mathematics 2023-06-26 Niven T. Achenjang , Jackson S. Morrow

In this paper we first prove the so-called large twist theorem, then using it to prove the boundedness of all solutions and the existence of quasi-periodic solutions for Duffing's equation $$ \ddot{x}+x^{2n+1}+\dsum_{i=0}^{2n}p_i(t)x^i=0,…

Classical Analysis and ODEs · Mathematics 2017-05-12 Xiong Li , Bin Liu , Yanmei Sun

We consider the polynomials $\displaystyle f(x)=x^d+c$, where $d\ge 2$ and $c\in\mathbb Q$. It is conjectured that if $d=2$, then $f$ has no rational periodic point of exact period $N\ge 4$. In this note, fixing some integer $d\ge 2$, we…

Number Theory · Mathematics 2018-04-27 Mohammad Sadek

We consider the cyclotomic identity testing (CIT) problem: given a polynomial $f(x_1,\ldots,x_k)$, decide whether $f(\zeta_n^{e_1},\ldots,\zeta_n^{e_k})$ is zero, where $\zeta_n = e^{2\pi i/n}$ is a primitive complex $n$-th root of unity…

Computational Complexity · Computer Science 2021-05-05 Nikhil Balaji , Sylvain Perifel , Mahsa Shirmohammadi , James Worrell

Let f: P^1 \to P^1 be a rational map with finite postcritical set P_f. Thurston showed that f induces a holomorphic map \sigma_f of the Teichmueller space T modelled on P_f to itself fixing the basepoint corresponding to the identity map…

Dynamical Systems · Mathematics 2011-05-10 Xavier Buff , Adam Epstein , Sarah Koch , Kevin Pilgrim

In the second paper [LZ24b] of this series, we obtained an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly…

Dynamical Systems · Mathematics 2024-12-31 Zhiqiang Li , Tianyi Zheng

A cyclotomic polynomial \Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we…

Number Theory · Mathematics 2012-07-30 Yves Gallot , Pieter Moree , Robert Wilms

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…

Dynamical Systems · Mathematics 2021-11-25 James Belk , Justin Lanier , Dan Margalit , Rebecca R. Winarski

In this paper, we give an explicit expression for a certain family of ternary cyclotomic polynomials: specifically $\Phi_{p_{1}p_{2}p_{3}}$, where $p_{1}<p_{2}<p_{3}$ are odd primes such that $p_{2} \equiv1 \mod p_{1}$ and $p_{3} \equiv1…

Number Theory · Mathematics 2018-01-18 Ala'a Al-Kateeb , Hoon Hong , Eunjeong Lee

We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…

Probability · Mathematics 2016-02-12 Dmitry Chelkak

We study the algorithmic complexity of the problem of deciding whether a Linear Time Invariant dynamical system with rational coefficients has bounded trajectories. Despite its ubiquitous and elementary nature in Systems and Control, it…

Systems and Control · Electrical Eng. & Systems 2021-09-24 Guillaume O. Berger , Raphaël M. Jungers