Related papers: Additive functionals of $d$-ary increasing trees
We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
The purpose of this paper is to introduce the notion of a generalized derivation which derivates a prescribed family of smooth vector-valued functions of several variables. The basic calculus rules are established and then a result derived…
Let $G$ be a finitely generated group. Given two length functions $\ell$ and $m$ of irreducible $G$ actions on real trees $A$ and $B$, when is the point-wise sum $\ell + m$ again the length function of an irreducible $G$ action on a real…
The main purpose of this paper is to give characterization theorems on derivations as well as on linear functions. Among others the following problem will be investigated: Let $n\in\mathbb{Z}$, $f, g\colon\mathbb{R}\to\mathbb{R}$ be…
A subset of leaves of a rooted tree induces a new tree in a natural way. The density of a tree $D$ inside a larger tree $T$ is the proportion of such leaf-induced subtrees in $T$ that are isomorphic to $D$ among all those with the same…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
For every sufficiently well-behaved function $g:\mathbb{R}_{\ge 0}\rightarrow\mathbb{R}_{\ge 0}$ that grows at least linearly and at most exponentially we construct a tree $T$ of uniform volume growth $g$, that is, $$C_1\cdot g(r/4)\le…
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…
Addition theorems can be constructed by doing three-dimensional Taylor expansions according to $f (\mathbf{r} + \mathbf{r}') = \exp (\mathbf{r}' \cdot \mathbf{\nabla}) f (\mathbf{r})$. Since, however, one is normally interested in addition…
We give an explicit description of the arithmetic-geometric extension of iterated Galois groups of rational functions. This yields a complete solution to the extension problem when either the arithmetic or the geometric iterated Galois…
Let $\mathcal{T}_{q+1}$ be the $(q+1)$-regular tree and let $G$ be a group of automorphisms acting transitively on the vertices and on the boundary of $\mathcal{T}_{q+1}$. We give an upper bound for the growth of cocycles with values in any…
The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…
A Markov Additive Process is a bi-variate Markov process $(\xi,J)=\big((\xi_t,J_t),t\geq0\big)$ which should be thought of as a multi-type L\'evy process: the second component $J$ is a Markov chain on a finite space $\{1,\ldots,K\}$, and…
We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
Under certain mild conditions, limit theorems for additive functionals of some $d$-dimensional self-similar Gaussian processes are obtained. These limit theorems work for general Gaussian processes including fractional Brownian motions,…
Addition formulas exist in trigonometric functions. Double-angle and half-angle formulas can be derived from these formulas. Moreover, the relation equation between the trigonometric function and the hyperbolic function can be derived using…
We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms. We give an invariance principle for such tree functionals for the Catalan model (random tree uniformly distributed among the full binary ordered…