English
Related papers

Related papers: Univalent Polynomials and Hubbard Trees

200 papers

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

Geometric Topology · Mathematics 2021-04-16 Michael Dougherty , Jon McCammond

The vector space spanned by rooted forests admits two graded bialgebra structures. The first is defined by A. Connes and D. Kreimer using admissible cuts, and the second is defined by D. Calaque, K. Ebrahimi-Fard and the second author using…

Combinatorics · Mathematics 2016-05-12 Mohamed Belhaj Mohamed , Dominique Manchon

In this project, we develop a new connection between the dynamics of quadratic polynomials on the complex plane and the dynamics of homeomorphisms of surfaces. In particular, given a quadratic polynomial, we investigate whether one can…

Dynamical Systems · Mathematics 2024-05-27 Mariam Al-Hawaj

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

We show that the absolute Galois group acts faithfully on the set of Hubbard trees. Hubbard trees are finite planar trees, equipped with self-maps, which classify postcritically finite polynomials as holomorphic dynamical systems on the…

Dynamical Systems · Mathematics 2007-05-23 Kevin Pilgrim

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

Data Structures and Algorithms · Computer Science 2012-10-24 Emil Jeřábek

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We introduce two operads which own the set of planar forests as a basis. With its usual product and two other products defined by different types of graftings, the algebra of planar rooted trees H becomes an algebra over these operads. The…

Rings and Algebras · Mathematics 2009-01-16 Loïc Foissy

For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic…

Combinatorics · Mathematics 2007-09-27 David Savitt

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of…

Commutative Algebra · Mathematics 2013-11-12 Raoul Blankertz , Joachim von zur Gathen , Konstantin Ziegler

The well-known Hermite-Biehler theorem claims that a univariate monic polynomial s of degree k has all roots in the open upper half-plane if and only if s=p+iq where p and q are real polynomials of degree k and k-1 resp. with all real,…

Classical Analysis and ODEs · Mathematics 2025-07-01 V. Kostov , B. Shapiro , M. Tyaglov

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…

Optimization and Control · Mathematics 2024-05-01 Sander Gribling , Sven Polak

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Combinatorics · Mathematics 2017-12-15 Manuel Aprile , Alfonso Cevallos , Yuri Faenza

We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…

Combinatorics · Mathematics 2011-09-22 L. Foissy , J. -C. Novelli , J. -Y. Thibon

Let f in Q[z] be a polynomial of degree d at least two. The associated canonical height \hat{h}_f is a certain real-valued function on Q that returns zero precisely at preperiodic rational points of f. Morton and Silverman conjectured in…

Number Theory · Mathematics 2008-12-03 Robert L. Benedetto , Benjamin Dickman , Sasha Joseph , Benjamin Krause , Daniel Rubin , Xinwen Zhou

There are two fundamental problems motivated by Silverman's conversations over the years concerning the nature of the exact values of canonical heights of $f(z)\in\bar{\mathbb{Q}}(z)$ where $f$ has degree $d\geq 2$. The first problem is the…

Number Theory · Mathematics 2022-01-03 Khoa D. Nguyen

We analyse the 3-extremal holomorphic maps from the unit disc $\mathbb{D}$ to the symmetrised bidisc $ \mathcal{G}$, defined to be the set $ \{(z+w,zw): z,w\in\mathbb{D}\}$, with a view to the complex geometry and function theory of…

Complex Variables · Mathematics 2013-07-29 Jim Agler , Zinaida A. Lykova , N. J. Young

In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…

Symbolic Computation · Computer Science 2020-01-22 Jing Yang , Chee K. Yap

We consider the set $\Pi ^*_d$ of monic polynomials $Q_d=x^d+\sum _{j=0}^{d-1}a_jx^j$, $x\in \mathbb{R}$, $a_j\in \mathbb{R}^*$, having $d$ distinct real roots, and its subsets defined by fixing the signs of the coefficients $a_j$. We show…

Classical Analysis and ODEs · Mathematics 2022-03-16 Vladimir Petrov Kostov

Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard \cite{Orsay} introduced these trees and showed that they encode the essential information of Julia sets…

Dynamical Systems · Mathematics 2014-02-26 Henk Bruin , Dierk Schleicher