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

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…

Whereas for strings, higher-order empirical entropy is the standard entropy measure, several different notions of empirical entropy for trees have been proposed in the past, notably label entropy, degree entropy, conditional versions of the…

Asymptotic behaviour of maximum sizes of induced trees and forests has been studied extensively in last decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: 1) We prove $2$-point…

Let $R_T$ be the Ricci matrix of a finite tree $T$ introduced in \cite{BaiChengHua2026}, the largest eigenvalue $\lambda_{\max}(R_T)$ determines the sign of a discrete Einstein metric curvature on the tree. This paper investigates the…

In this paper, we study some tree properties and their related indiscernibilities. First, we prove that SOP$_2$ can be witnessed by a formula with a tree of tuples holding 'arbitrary homogeneous inconsistency' (e.g., weak k-TP$_1$…

Large language models achieve strong reasoning performance, yet existing decoding strategies either explore blindly (random sampling) or redundantly (independent multi-sampling). We propose Entropy-Tree, a tree-based decoding method that…

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…

We study various types of consistency of honest decision trees and random forests in the regression setting. In contrast to related literature, our proofs are elementary and follow the classical arguments used for smoothing methods. Under…

Let $T$ be a tree with a given adjacency eigenvalue $\lambda$. In this paper, by using the $\lambda$-minimal trees, we determine the structure of trees with a given multiplicity of the eigenvalue $\lambda$. Furthermore, we consider the…

The zero-entropy-density conjecture states that the entropy density, defined as the limit of S(N)/N at infinity, vanishes for all translation-invariant pure states on the spin chain. Or equivalently, S(N), the von Neumann entropy of such a…

Assuming some large cardinals, a model of ZFC is obtained in which aleph_{omega+1} carries no Aronszajn trees. It is also shown that if lambda is a singular limit of strongly compact cardinals, then lambda^+ carries no Aronszajn trees.

The entanglement entropy of a noninteracting fermionic system confined to a two-dimensional honeycomb lattice on a torus is calculated. We find that the entanglement entropy can characterize Lifshitz phase transitions without a local order…

On trees of fixed order, we show a direct relation between Kemeny's constant and Wiener index, and provide a new formula of Kemeny's constant from the relation with a combinatorial interpretation. Moreover, the relation simplifies proofs of…

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.…

We prove that every 2-sphere graph different from a prism can be vertex 4-colored in such a way that all Kempe chains are forests. This implies the following three tree theorem: the arboricity of a discrete 2-sphere is 3. Moreover, the…

We find ourselves in an extended era of entropy production. Unlike most other observations, the arrow of time is usually regarded as a constraint on initial conditions. I argue, however, that it primarily constrains the vacuum structure of…

We show that the structure of a growing tree preserves an information on the shape of an initial graph. For the exponential trees, evidence of this kind of memory is provided by means of the iterative equations, derived for the moments of…

This paper addresses the question of the fluctuations of the empirical entropy of a chain of infinite order. We assume that the chain takes values on a finite alphabet and loses memory exponentially fast. We consider two possible…

A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…

We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…