Related papers: Trees in positive entropy subshifts
Diversity is a fundamental feature of ecosystems, even when the concept of ecosystem is extended to sociology or economics. Diversity can be intended as the count of different items, animals, or, more generally, interactions. There are two…
We study the extreme local structure of plane binary trees through the distribution of leaves at maximum depth. We first address two basic questions: (i) the asymptotic probability that exactly two leaves occur at the deepest level, and…
This article presents two novel algorithms for generating random increasing trees. The first algorithm efficiently generates strictly increasing binary trees using an ad hoc method. The second algorithm improves the recursive method for…
It is possible to define mixing properties for subshifts according to the intensity which allows to concatenate two rectangular blocks. We study the interplay between this intensity and computational properties. In particular we prove that…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…
We study the bilipschitz equivalence type of tree-graded spaces, showing that asymptotic cones of relatively hyperbolic groups (resp. asymptotic cones of groups containing a cut-point) only depend on the bilipschitz equivalence types of the…
We consider a continuous-time symmetric supercritical branching random walk on a multidimensional lattice with a finite set of the particle generation centres, i.e. branching sources. The main object of study is the evolutionary operator…
We consider a stochastic process that describes several particles interacting by either merging or annihilation. When two particles merge, they combine their masses; when annihilation occurs, only the particle of smallest mass survives.…
We construct forests that span $\mathbb{Z}^d$, $d\geq2$, that are stationary and directed, and whose trees are infinite, but for which the subtrees attached to each vertex are as short as possible. For $d\geq3$, two independent copies of…
In this work we study the problem of positiveness of topological entropy for flows using pointwise dynamics. We show that the existence of a non-periodic nonwandering point of an expansive and non-singular flow with shadowing is a…
We observe that a standard transformation between \emph{ordinal} trees (arbitrary rooted trees with ordered children) and binary trees leads to interesting succinct binary tree representations. There are four symmetric versions of these…
Let $\left\{ Z_{n},n=0,1,2,...\right\} $ be a critical branching process in random environment and let $\left\{ S_{n},n=0,1,2,...\right\} $ be its associated random walk. It is known that if the increments of this random walk belong…
In a previous paper ("A characterization of topologically completely positive entropy for shifts of finite type"), the author gave a characterization for when a $\mathbb{Z}^d$-shift of finite type (SFT) has no nontrivial subshift factors…
In this paper we give a new family of complete intersections which have the strong Lefschetz property. The family consists of (Artinian algebras defined by) ideals generated by power sum symmetric polynomials of consecutive degrees and of…
We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…
We define and give explicit construction of the universal tree-graded space with a given collection of pieces. We apply that to proving uniqueness of asymptotic cones of relatively hyperbolic groups whose peripheral subgroups have unique…
We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group.…
We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary…
In this paper, we first concentrate on the possible values and dense property of entropies for isotropic and anisotropic axial products of subshifts of finite type (SFTs) on $\mathbb{N}^d$ and $d$-tree $\mathcal{T}_d$. We prove that the…