Related papers: Rooted trees and an exponential-like series

A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…

This is an exposition in order to give an explicit way to understand (1) a non-topological proof for an existence of a base of an affine root system, (2) a Serre-type definition of an elliptic Lie algebra with rank =>2, and (3) the…

We give a simple characterization of Lie elements in free pre-Lie algebras as elements of the kernel of a map between spaces of trees. We explain how this result is related to natural operations on the Chevalley-Eilenberg complex of a Lie…

The power flow equations are non-linear multivariate equations that describe the relationship between power injections and bus voltages of electric power networks. Given a network topology, we are interested in finding network parameters…

A tree functional is called additive if it satisfies a recursion of the form $F(T) = \sum_{j=1}^k F(B_j) + f(T)$, where $B_1,\ldots,B_k$ are the branches of the tree $T$ and $f(T)$ is a toll function. We prove a general central limit…

We prove a conjecture of Chapoton from 2010 stating that the pre-Lie operad, as a Lie algebra in the symmetric monoidal category of linear species, is freely generated by the free operad on the species of cyclic Lie elements.

We study groups, exponential groups and ordered groups equipped with valuations. We investigate algebraic and topological features of such valued structures, and apply our findings in order to solve regular equations over groups using…

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

A family of formal power series, such that its coefficients satisfy a recursion formula, is characterized in terms of the summability, in the sense of J. P. Ramis, of its elements along certain well chosen directions. We describe a set of…

We consider stochastic differential systems driven by continuous semimartingales and governed by non-commuting vector fields. We prove that the logarithm of the flowmap is an exponential Lie series. This relies on a natural change of basis…

The active field of Functional Data Analysis (about understanding the variation in a set of curves) has been recently extended to Object Oriented Data Analysis, which considers populations of more general objects. A particularly challenging…

We study a coloured operad involving rooted trees and directed cycles of rooted trees that generalizes the operad of rooted trees of Chapoton and Livernet. We describe all the relations between the generators of a certain suboperad of that…

For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…

We consider the generating polynomial of the number of rooted trees on the set $\{1,2,\dots,n\}$ counted by the number of descending edges (a parent with a greater label than a child). This polynomial is an extension of the descent…

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…

To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…

In this work, we study the concept of the length function and some of its combinatorial properties for the class of extended affine root systems of type $A_1$. We introduce a notion of root basis for these root systems, and using a unique…

In this paper we show that prime sum graphs on $n$ vertices -- which are graphs on vertex set $\{1,2,...,n\}$ where $ij$ is an edge when $i+j$ is prime -- contain all trees with at most $\exp( c \log n / \log\log n)$ vertices as induced…

We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…