Related papers: Entire functions arising from trees

To each isolated critical point of a smooth function on a 3-manifold we put in correspondence a tree (graph without cycles). We will prove that functions are topologically equivalent in the neighborhoods of critical points if and only if…

Recently a function was constructed that satisfies all known properties of a tree-level scattering of four massless scalars via the exchange of an infinite tower of particles with masses given by the non-trivial zeroes of the Riemann zeta…

Using the wedge sum of metric spaces, for all compact metrizable spaces, we construct a topological embedding of the compact metrizable space into the set of all metric trees in the Gromov--Hausdorff space with finite prescribed values. As…

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

It is shown that for any non-decreasing, continuous and unbounded doubling function $\om$ on $[0,1)$, there exist two analytic infinite products $f_0$ and $f_1$ such that the asymptotic relation $|f_0(z)| + |f_1(z)| \asymp \om(|z|)$ is…

If $f$ is an entire function and $a$ is a complex number, $a$ is said to be an asymptotic value of $f$ if there exists a path $\gamma$ from $0$ to infinity such that $f(z) - a$ tends to $0$ as $z$ tends to infinity along $\gamma$. The…

We consider a class of weighted harmonic functions in the open upper half-plane known as $\alpha$-harmonic functions. Of particular interest is the uniqueness problem for such functions subject to a vanishing Dirichlet boundary value on the…

Let f be an entire function that has only finitely many critical and asymptotic values. Up to topological equivalence, the function $f$ is determined by combinatorial information, more precisely by an infinite graph known as a…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

We prove that there exists an entire function for which every complex number is an asymptotic value and whose growth is arbitrarily slow subject only to the necessary condition that the function is of infinite order.

We define a notion of tiling of the full infinite $p$-ary tree, establishing a series of equivalent criteria for a subtree to be a tile, each of a different nature; namely, geometric, algebraic, graph-theoretic, order-theoretic, and…

We use Bowen's definition of topological entropy and Ahlfors five islands theorem, as well as the theory of polynomial-like mappings, to show that the topological entropy of any entire transcendental function is infinity. In addition the…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

We construct a tree T of maximal degree 3 with infinitely many leaves such that whenever finitely many of them are removed, the remaining tree is isomorphic to T. In this sense T resembles an infinite star.

In this paper we consider the topological class, denoted by AV2, of universal covering maps from the plane to the sphere with two removed points. We prove that an element f in AV2 with finite post-singular set is combinatorially equivalent…

We prove that all entire transcendental entire functions have infinite topological entropy.

Let f be a nonconstant meromorphic function in the plane and h be a nonconstant elliptic function. We show that if all zeros of f are multiple exept finitely many and T(r,h)=o{T(r,f)} as r tends to infinity, then f'=h has infinitely many…

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…