Related papers: Tree indiscernibilities, revisited
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…
The quantity that captures the asymptotic value of the maximum number of appearances of a given topological tree (a rooted tree with no vertices of outdegree $1$) $S$ with $k$ leaves in an arbitrary tree with sufficiently large number of…
Interpretability is an elusive but highly sought-after characteristic of modern machine learning methods. Recent work has focused on interpretability via $\textit{explanations}$, which justify individual model predictions. In this work, we…
The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…
Imitating a recently introduced invariant of trees, we initiate the study of the inducibility of $d$-ary trees (rooted trees whose vertex outdegrees are bounded from above by $d\geq 2$) with a given number of leaves. We determine the exact…
The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various…
We present infinite analogues of our splinter lemma from [Trees of tangles in abstract separation systems, arXiv:1909.09030]. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation…
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…
In Zanardo, 1998, the Peircean semantics for branching-time logics is enriched with a notion of indistinguishability at a moment t between histories passing through t. Trees with indistinguishability relations provide a semantics for a…
The tree theorem for pairs ($\mathsf{TT}^2_2$), first introduced by Chubb, Hirst, and McNicholl, asserts that given a finite coloring of pairs of comparable nodes in the full binary tree $2^{<\omega}$, there is a set of nodes isomorphic to…
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
We provide a complete description of possible covariance matrices consistent with a Gaussian latent tree model for any tree. We then present techniques for utilising these constraints to assess whether observed data is compatible with that…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
Text embeddings are a fundamental component in many NLP tasks, including classification, regression, clustering, and semantic search. However, despite their ubiquitous application, challenges persist in interpreting embeddings and…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…