Related papers: Combinatorial Hubbard trees for postcritically inf…
We consider some two-dimensional birational transformations. One of them is a birational deformation of the H\'enon map. For some of these birational mappings, the post critical set (i.e. the iterates of the critical set) is infinite and we…
We prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is…
We consider both analytically and numerically creation conditions of diverse hierarchical trees. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into united structure is…
We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…
We consider the space $P$ of generic complex 5-degree polynomials. Critical values of such polynomial, i.e. four points in the complex plane, either are vertices of a convex quadrangle $Q$, or vertices of a triangle $T$ with one point…
We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic morphism f with an infinite postcritical orbit over a field of characteristic different from two. This is a…
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…
Kurz et al. have recently shown that infinite $\lambda$-trees with finitely many free variables modulo $\alpha$-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of…
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing…
We study Jacobi matrices on trees with one end at inifinity. We show that the defect indices cannot be greater than 1 and give criteria for essential selfadjointness. We construct certain polynomials associated with matrices, which mimic…
Classical trajectories are calculated for two Hamiltonian systems with ring shaped potentials. Both systems are super-integrable, but not maximally super-integrable, having four globally defined single valued integrals of motion each. All…
A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A classical result states that for any 2-tree $T$ with…
We prove that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits.
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…
The plucking polynomial is an invariant of rooted trees with connections to knot theory. The polynomial was constructed in 2014 as a tool to analyze lattice crossings after taking the quotient by the Kauffman bracket skein relations. In…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable…
We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…
Degree-$d$-invariant laminations of the disk model the dynamical action of a degree-$d$ polynomial; such a lamination defines an equivalence relation on $S^1$ that corresponds to dynamical rays of an associated polynomial landing at the…