Related papers: Trees in positive entropy subshifts

We construct the set of theories which share the property that the tree-level amplitudes nullify even if both initial and final states contain the same type of particles. The origin of this phenomenon lies in the fact that the reduced…

Topologically constrained genome-like polymers often double-fold into tree-like configurations. Here we calculate the exact number of tightly double-folded configurations available to a ring polymer in ideal conditions. For this purpose, we…

The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…

We investigate the relationship between the dynamical properties of minimal topological dynamical systems and the multiplicative combinatorial properties of return time sets arising from those systems. In particular, we prove that for a…

Four-particle tree-level scattering amplitudes in string theory are magically consistent with unitarity, reflected in the non-trivial fact that beneath the critical dimension, the residues of the amplitudes on massive poles can be expanded…

We study the dynamics of a charged particle in a planar magnetic field which consists of $n\geq 2$ disjoint localized peaks. We show that, under mild geometric conditions, this system is semi-conjugated to the full shift on $n$ symbols and,…

We consider a continuous-time branching random walk in the inhomogeneous breeding potential $\beta|.|^p$, where $\beta > 0$, $p \geq 0$. We prove that the population almost surely explodes in finite time if $p > 1$ and doesn't explode if $p…

The strip entropy is studied in this article. We prove that the strip entropy approximation is valid for every ray of a golden-mean tree. This result extends the previous result of [Petersen-Salama, Discrete \& Continuous Dynamical Systems,…

We consider the existence of the topological entropy of shift spaces on a finitely generated semigroup whose Cayley graph is a tree. The considered semigroups include free groups. On the other hand, the notion of stem entropy is introduced.…

The Binary Search Tree (BST) is average in computer science which supports a compact data structure in memory and oneself even conducts a row of quick algorithms, by which people often apply it in dynamical circumstance. Besides these…

The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…

We consider a branching stable process with positive jumps, i.e. a continuous-time branching process in which the particles evolve independently as stable L{\'e}vy processes with positive jumps. Assuming the branching mechanism is critical…

In this paper we study asymptotic properties of random forests within the framework of nonlinear time series modeling. While random forests have been successfully applied in various fields, the theoretical justification has not been…

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…

We give a notion of entropy for general gemetric structures, which generalizes well-known notions of topological entropy of vector fields and geometric entropy of foliations, and which can also be applied to singular objects, e.g. singular…

It is shown that for every positive integer $n$ there exists a subnormal weighted shift on a directed tree (with or without root) whose $n$th power is densely defined while its $(n+1)$th power is not. As a consequence, for every positive…

We address the problem of building and maintaining distributed spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed. In these harsh environments, we…

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…