Related papers: Tree substitutions and Rauzy fractals
How can we effectively find the best structures in tree models? Tree models have been favored over complex black box models in domains where interpretability is crucial for making irreversible decisions. However, searching for a tree…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We introduce a new perspective on a procedure for generating pseudo-Anosov homemorphisms from postcritically finite interval maps. The central idea is the realization of a tree structure on one such family of pseudo-Anosovs: individual…
We prove a dynamical variant of the Tits alternative for the group of almost automorphisms of a locally finite tree $\mathcal{T}$: a group of almost automorphisms of $\mathcal{T}$ either contains a nonabelian free group playing ping-pong on…
We propose the first comprehensive approach for modeling and analyzing the spatiotemporal shape variability in tree-like 4D objects, i.e., 3D objects whose shapes bend, stretch, and change in their branching structure over time as they…
Planning long duration robotic manipulation sequences is challenging because of the complexity of exploring feasible trajectories through nonlinear contact dynamics and many contact modes. Moreover, this complexity grows with the problem's…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
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…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
We consider generalized interval exchange transformations, or briefly GIETs, that is bijections of the interval which are piecewise increasing homeomorphisms with finite branches. When all continuous branches are translations, such maps are…
An imitation of 2d field theory is formulated by means of a model on the hierarhic tree (with branching number close to one) with the same potential and the free correlators identical to 2d correlators ones. Such a model carries on some…
We introduce the notion of mixed subtree quasi-isometries, which are self quasi-isometries of regular trees built in a specific inductive way. We then show that any self quasi-isometry of a regular tree is at bounded distance from a…
The first author has associated in a natural way a profinite group to each irreducible subshift. The group in question was initially obtained as a maximal subgroup of a free profinite semigroup. In the case of minimal subshifts, the same…
We provide a rigorous framework for handling uncertainty in quantitative fault tree analysis based on fuzzy theory. We show that any algorithm for fault tree unreliability analysis can be adapted to this framework in a fully general and…
This study addresses the predictive limitation of probabilistic circuits and introduces transformations as a remedy to overcome it. We demonstrate this limitation in robotic scenarios. We motivate that independent component analysis is a…
We study isometric actions of finitely presented groups on $\mathbb{R}$-trees. In this paper, we develop a relative version of the Rips machine to study $\textit{pairs}$ of such actions. An important example of a $\textit{pair}$ is a group…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior. For morphic superword we prove periodicity of Rauzy schemes.…
It is well known for an irreducible free group automorphism that its growth rate is equal to the minimal Lipschitz displacement of its action on Culler-Vogtmann space. This follows as a consequence of the existence of train track…
The Replica Fourier Transform is the generalization of the discrete Fourier Transform to quantities defined on an ultrametric tree. It finds use in con- junction of the replica method used to study thermodynamics properties of disordered…