Related papers: Construction du coeur compact d'un arbre r\'eel pa…

We work with attracting subshifts generated by substitutions which are also irreducible parageometric automorphisms of free groups. For such a dynamical system, we construct a tree substitution to approximate the repelling real tree of the…

We consider certain groups of tree automorphisms as so-called diffeological groups. The notion of diffeology, due to Souriau, allows to endow non-manifold topological spaces, such as regular trees that we look at, with a kind of a…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

This paper addresses several structural aspects of the insertion-elimination algebra, a Lie algebra that can be realized in terms of tree-inserting and tree-eliminating operations on the set of rooted trees. In particular, we determine the…

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of…

Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…

The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant…

To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…

We define a `tree of fusion systems' and give a sufficient condition for its completion to be saturated. We apply this result to enlarge an arbitrary fusion system by extending the automorphism groups of certain of its subgroups.

We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.

We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…

We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…

We give an algorithm to determine if the dynamical system generated by a positive automorphism of the free group can also be generated by a self-induced interval exchange transformation. The algorithm effectively yields the interval…

We present a general scheme how to construct a substitution rule for generating $d$-dimensional analogues of the paperfolding structures. This substitution is proven to be primitive, so that the translation action on the hull forms a…

Tree ensembles are flexible predictive models that can capture relevant variables and to some extent their interactions in a compact and interpretable manner. Most algorithms for obtaining tree ensembles are based on versions of boosting or…

We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…

In this paper we present a new characterization of free group actions (in classical differential geometry), involving dynamical systems and representations of the corresponding transformation groups. In fact, given a dynamical system, we…

Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…

Temporal graphs represent interactions between entities over time. Deciding whether entities can reach each other through temporal paths is useful for various applications such as in communication networks and epidemiology. Previous works…