The Fatou conjecture (or the HD conjecture) asserts that any rational function can be approximated by hyperbolic rational functions of the same degree and any polynomial can be approximated by hyperbolic polynomials of the same degree. The real Fatou conjecture asserts that a real polynomial can be approximated by hyperbolic real polynomials of the same degree. A possible solution of these conjecture comes from solving the rigidity problem: any two combinatorial rational functions are quasiconformally conjugate (this state-ment is usually named the combinatorial rigidity conjecture); and a rational map other than a Latt\‘es example, carries no invariant line field on the Julia set (this is named the quasiconformal rigidity conjecture, or th...
A rational polytope is the convex hull of a finite set of points in Rd with rational coordinates. Gi...
9 figuresWe study rigidity of rational maps that come from Newton's root finding method for polynomi...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
Sem dúvida a questão central em Dinâmica Holomorfa é aquela sobre a densidade de hiperbolicidade. Te...
We prove the topological (or combinatorial) rigidity property for real polynomials with all critical...
AbstractLet ƒ ∈ Q[y] be a polynomial of degree n over the rationals. Assume ƒ is indecomposable and ...
Abstract. We describe a new and robust method to prove rigidity results in complex dynamics. The new...
AbstractEhrhartʼs famous theorem states that the number of integral points in a rational polytope is...
We prove that topologically conjugate non-renormalizable polynomials are quasi-conformally conjugate...
We introduce a class of Laurent polynomials, called maximally mutable Laurent polynomials (MMLPs), w...
We construct families of non-toric $\mathbb{Q}$-factorial terminal Fano ($\mathbb{Q}$-Fano) threefol...
The finite Pfaff lattice is given by commuting Lax pairs involving a finite matrix L (zero above the...
We give an arithmetic proof of rigidity for postcritically finite polynomials of prime power degree
Non-renormalizable Newton maps are rigid. More precisely, we prove that their Julia set carries no i...
Mathematicians have been interested in the rigidity of frameworks since Euler’s conjecture in 1776 t...
A rational polytope is the convex hull of a finite set of points in Rd with rational coordinates. Gi...
9 figuresWe study rigidity of rational maps that come from Newton's root finding method for polynomi...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
Sem dúvida a questão central em Dinâmica Holomorfa é aquela sobre a densidade de hiperbolicidade. Te...
We prove the topological (or combinatorial) rigidity property for real polynomials with all critical...
AbstractLet ƒ ∈ Q[y] be a polynomial of degree n over the rationals. Assume ƒ is indecomposable and ...
Abstract. We describe a new and robust method to prove rigidity results in complex dynamics. The new...
AbstractEhrhartʼs famous theorem states that the number of integral points in a rational polytope is...
We prove that topologically conjugate non-renormalizable polynomials are quasi-conformally conjugate...
We introduce a class of Laurent polynomials, called maximally mutable Laurent polynomials (MMLPs), w...
We construct families of non-toric $\mathbb{Q}$-factorial terminal Fano ($\mathbb{Q}$-Fano) threefol...
The finite Pfaff lattice is given by commuting Lax pairs involving a finite matrix L (zero above the...
We give an arithmetic proof of rigidity for postcritically finite polynomials of prime power degree
Non-renormalizable Newton maps are rigid. More precisely, we prove that their Julia set carries no i...
Mathematicians have been interested in the rigidity of frameworks since Euler’s conjecture in 1776 t...
A rational polytope is the convex hull of a finite set of points in Rd with rational coordinates. Gi...
9 figuresWe study rigidity of rational maps that come from Newton's root finding method for polynomi...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...