Related papers: The Jacaranda tree is strongly aperiodic and has z…

New entropy measures have been recently introduced for the quantification of the complexity of networks. Most of these entropy measures apply to static networks or to dynamical processes defined on static complex networks. In this paper we…

We show that the existence of a well-known type of ideals on a regular cardinal $\lambda$ implies a compactness property concerning the specialisability of a tree of height $\lambda$ with no cofinal branches. We also use Neeman's method of…

It is known that every homeomorphism of the plane has a fixed point in a non-separating, invariant subcontinuum. Easy examples show that a branched covering map of the plane can be periodic point free. In this paper we show that any…

We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples…

We address how to construct an infinitely cyclic universe model. A major consideration is to make the entropy cyclic which requires the entropy to be reset to zero in each cycle expansion to turnaround, to contraction, to bounce, etc. Here…

In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…

An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…

Periodic trees are combinatorial structures which are in bijection with cluster tilting objects in cluster categories of affine type $\tilde{A}_{n-1}$. The internal edges of the tree encode the $c$-vectors corresponding to the cluster…

We revisit textbook claims that entropy must increase and show that, under time-reversal invariant microscopic dynamics, no universal trajectory-wise or statistical assertion that the coarse-grained entropy $S(t)$ is non-decreasing can…

In this short note, we prove a uniqueness result for small entropy self-expanders asymptotic to a fixed cone. This is a direct consequence of the mountain-pass theorem and the integer degree argument proved by J. Bernstein and L. Wang.

The notion of tree-shifts constitutes an intermediate class in between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing of the entropy of a tree-shift of finite type. Meanwhile, the entropy of…

By a result of Blokh from 1984, every transitive map of a tree has the relative specification property, and so it has finite decomposition ideal, positive entropy and dense periodic points. In this paper we construct a transitive dendrite…

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

We study the statistics of branching polymers with excluded-volume interactions, by modeling them as single self-avoiding trees on a generic regular periodic lattice with coordination number $q$. Each lattice site can be occupied at most by…

We consider the structure of aperiodic points in $\mathbb Z^2$-subshifts, and in particular the positions at which they fail to be periodic. We prove that if a $\mathbb Z^2$-subshift contains points whose smallest period is arbitrarily…

We prove a fix point theorem for monoids of self-embeddings of trees. As a corollary, we obtain a result by Laflamme, Pouzet and Sauer that a tree either contains a subdivided binary tree as a subtree or has a vertex, and edge, an end or…

We study the directional entropy of the dynamical system associated to a $\Z^2$ configuration in a finite alphabet. We show that under local assumptions on the complexity, either every direction has zero topological entropy or some…

We construct an example of a subperiodic tree whose intermediate branching number is strictly less than the lower intermediate growth rate. This answers a question of Amir and Yang (2022) in the negative.

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…