相关论文: Wandering polygons and recurrent critical leaves

It is well known that the dynamical behavior of a rational map $f:\widehat{\mathbb C}\to \widehat{\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical…

A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-factor-critical graphs and 2-factor-critical graphs are…

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

We consider infinitely renormalizable Lorenz maps with real critical exponent $\alpha>1$ and combinatorial type which is monotone and satisfies a long return condition. For these combinatorial types we prove the existence of periodic points…

We discuss the dynamic and structural properties of polynomial semigroups, a natural extension of iteration theory to random (walk) dynamics, where the semigroup $G$ of complex polynomials (under the operation of composition of functions)…

A chord diagram is a set of chords in which no pair of chords has a common endvertex. For a chord diagram $E$ having a crossing $S = \{ ac, bd \}$, by the chord expansion of $E$ with respect to $S$, we have two chord diagrams $E_1 =…

We study algebraic dynamical systems (and, more generally, $\sigma$-varieties) $\Phi:{\mathbb A}^n_{\mathbb C} \to {\mathbb A}^n_{\mathbb C}$ given by coordinatewise univariate polynomials by refining a theorem of Ritt. More precisely, we…

Let $N$ be a nilpotent group normal in a group $G$. Suppose that $G$ acts transitively upon the points of a finite non-Desarguesian projective plane $\mathcal{P}$. We prove that, if $\mathcal{P}$ has square order, then $N$ must act…

While motivated by structural problems in mathematical music theory, this article introduces a novel combinatorial framework that advances the classification of cyclic cubic bipartite graphs. We extend the classical study of Levi graphs by…

A digraph $D=(V, A)$ has a good pair at a vertex $r$ if $D$ has a pair of arc-disjoint in- and out-branchings rooted at $r$. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such that $H_i$ has…

Let $G$ be a Cayley graph of a nonamenable group with spectral radius $\rho < 1$. It is known that branching random walk on $G$ with offspring distribution $\mu$ is transient, i.e., visits the origin at most finitely often almost surely, if…

We study the set of critical points of a solution to $\Delta u = \lambda \cdot u$ and in particular components of the critical set that have codimension 1. We show, for example, that if a second Neumann eigenfunction of a simply connected…

For $f$ an entire transcendental map with a univalent Baker domain $U$ of hyperbolic type I, we study pinching deformations in $U$, the support of this deformation being certain laminations in the grand orbit of $U$. We show that pinching…

We tackle the problem of constructing increasing-chord graphs spanning point sets. We prove that, for every point set P with n points, there exists an increasing-chord planar graph with O(n) Steiner points spanning P. Further, we prove…

A completely stable multicurve of a post-critically finite rational map induces a combinatorial decomposition. The projections of the small Julia sets are immersed within the original Julia set. We prove that two small Julia sets are…

We introduce a class of infinitely renormalizable, unicritical diffeomorphisms of the disk (with a non-degenerate "critical point"). In this class of dynamical systems, we show that under renormalization, maps eventually become…

It is proved that for every complex quadratic polynomial $f$ with Cremer's fixed point $z_0$ (or periodic orbit) for every $\delta>0$, there is at most one periodic orbit of minimal period $n$ for all $n$ large enough, entirely in the disc…

A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are…

A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be immediately renormalizable if there exists a (connected) QL invariant filled Julia set $K^*$ such that $b\in K^*$. In that case, exactly one critical point of $P$…

Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…