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

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…

With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…

A relaxed $k$-ary tree is an ordered directed acyclic graph with a unique source and sink in which every node has out-degree $k$. These objects arise in the compression of trees in which some repeated subtrees are factored and repeated…

The relevance of the algebraic entropy in the study of birational discrete time dynamical systems highlights the need to relate it to other characteristics of these systems. In this letter, two complementary proofs are given that the…

We study the point spectrum of a periodic quantum tree equipped with a Schr\"odinger type differential operator with delta-type vertex conditions, using subsets of the compact graph that generates the tree. We prove analogs of existing…

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with…

For $n$-vertex, $d$-dimensional lattices $\Lambda$ with $d \ge 2$, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present an exact closed-form result for the…

In this paper we investigate the problem of the distributivity of Kurepa trees. We show that it is consistent that there are Kurepa trees and for every Kurepa tree there is a small forcing notion which adds a branch to it without collapsing…

Let $T$ be a tree, we show that the null space of the adjacency matrix of $T$ has relevant information about the structure of $T$. We introduce the Null Decomposition of trees, and use it in order to get formulas for independence number and…

We are interested in dendrites for which all invariant measures of zero-entropy mappings have discrete spectrum, and we prove that this holds when the closure of the endpoint set of the dendrite is countable. This solves an open question…

We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the…

We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…

For a lattice $\Lambda$ with $n$ vertices and dimension $d$ equal or higher than two, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral…

The topological entropy of piecewise affine maps is studied. It is shown that singularities may contribute to the entropy only if there is angular expansion and we bound the entropy via the expansion rates of the map. As a corollary we…

The uncertainty of multidimensional shift spaces draws attracted attention of researchers. For example, the emptiness problem is undecidable; there exist aperiodic shifts of finite type; there is a nonempty shift of finite type exhibiting…

We prove the almost sure existence of absolutely continuous spectrum at low disorder for the Anderson model on the simplest example of a product of a regular tree with a finite graph. This graph contains loops of unbounded size.

We study the dependence of entropy [per lattice site] of six-vertex model on boundary conditions. We start with lattices of finite size and then proceed to thermodynamic limit. We argue that the six-vertex model with periodic, anti-periodic…

It has been demonstrated that excitable media with a tree structure performed better than other network topologies, it is natural to consider neural networks defined on Cayley trees. The investigation of a symbolic space called tree-shift…

We show that for lazy simple random walks on finite spherically symmetric trees, the ratio of the mixing time and the relaxation time is bounded by a universal constant. Consequently, lazy simple random walks on any sequence of finite…

We study basic spectral features of graph Laplacians associated with a class of rooted trees which contains all regular trees. Trees in this class can be generated by substitution processes. Their spectra are shown to be purely absolutely…