相关论文: Reading escaping trees from Hubbard trees in Sn

We study the bifurcation loci of quadratic (and unicritical) polynomials and exponential maps. We outline a proof that the exponential bifurcation locus is connected; this is an analog to Douady and Hubbard's celebrated theorem that (the…

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).

A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values $\lambda_1$ and $\lambda_2$ for global and local survival were different. Here, we will consider the case of trees…

Let c be a real parameter in the Mandelbrot set, and f_c(z):= z^2 + c. We prove a formula relating the topological entropy of f_c to the Hausdorff dimension of the set of rays landing on the real Julia set, and to the Hausdorff dimension of…

Unimodality of the normalized coefficients of the characteristic polynomial of distance matrices of trees are known and bounds on the location of its peak (the largest coefficient) are also known. Recently, an extension of these results to…

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…

In this paper, we consider some cubic near-Hamiltonian systems obtained from perturbing the symmetric cubic Hamiltonian system with two symmetric singular points by cubic polynomials. First, following Han [2012] we develop a method to study…

As we all know, the $k$-ary $n$-cube is a highly efficient interconnect network topology structure. It is also a concept of great significance, with a broad range of applications spanning both mathematics and computer science. In this…

We show that any compact, connected set $K$ in the plane can be approximated by the critical points of a polynomial with two critical values. Equivalently, $K$ can be approximated in the Hausdorff metric by a true tree in the sense of…

We study the fine geometric structure of bifurcation currents in the parameter space of cubic polynomials viewed as dynamical systems. In particular we prove that these currents have some laminar structure in a large region of parameter…

We study ultrametric germs in one variable having an irrationally indifferent fixed point at the origin with a prescribed multiplier. We show that for many values of the multiplier, the cycles in the unit disk of the corresponding monic…

The isolation intervals of the real roots of the symbolic monic cubic polynomial $x^3 + a x^2 + b x + c$ are determined, in terms of the coefficients of the polynomial, by solving the Siebeck-Marden-Northshield triangle - the equilateral…

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

Let $K$ be a tamely ramified abelian cubic number field with discriminant $D_K$. We prove that the number of trace-one monic integral polynomials with root field $K$ and height $H$ is equal to the number of ideals in the quadratic field…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

The quantum phase diagram of the Hubbard chain with correlated hopping is accurately determined through jumps in $\pi$ in the charge and spin Berry phases. The nature of each thermodynamic phase, and the existence of charge and spin gaps,…

The (unweighted) tree edit distance problem for $n$ node trees asks to compute a measure of dissimilarity between two rooted trees with node labels. The current best algorithm from more than a decade ago runs in $O(n ^ 3)$ time [Demaine,…

We show that corner polyhedra and 3-connected Schnyder labelings join the growing list of planar structures that can be set in exact correspondence with (weighted) models of quadrant walks via a bijection due to Kenyon, Miller, Sheffield…

This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…