Related papers: Kurepa trees, continuous images, and perfect set p…
We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…
The paper studies a class of variational problems, modeling optimal shapes for tree roots. Given a measure $\mu$ describing the distribution of root hair cells, we seek to maximize a harvest functional $\mathcal{H}$, computing the total…
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a…
K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…
Let $\mathbb{F}$ be the field of real Puiseux series and $\mathcal{T}_\mathbb{F}$ the $\mathbb{Q}$-tree defined by Brumfiel. We show that completing all the segments of $\mathcal{T}_\mathbb{F}$ does not result in a complete metric space.
We prove that the dual fine Selmer group of an abelian variety over the unramified $\mathbb{Z}_{p}$-extension of a function field is finitely generated over $\mathbb{Z}_{p}$. This is a function field version of a conjecture of…
We show that even for subsets X of the real line which do not contain perfect sets, the Hurewicz property does not imply the property S1(Gamma,Gamma), asserting that for each countable family of open gamma-covers of X, there is a choice…
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…
We answer two longstanding questions of Klopsch (1999) and Shalev (2000) by proving that the finitely generated Hausdorff spectrum of the closure of a finitely generated regular branch group with respect to the level-stabilizer filtration…
Let $S=\mathbb{K}[x_1,\dots, x_n]$ be a polynomial ring, where $\mathbb{K}$ is a field, and $G$ be a simple graph on $n$ vertices. Let $J(G)\subset S$ be the vertex cover ideal of $G$. Herzog, Hibi and Ohsugi have conjectured that all…
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…
We study Hecke algebras of groups acting on trees with respect to geometrically defined subgroups. In particular, we consider Hecke algebras of groups of automorphisms of locally finite trees with respect to vertex and edge stabilizers and…
The question of shellability of complexes of directed trees was asked by R. Stanley. D. Kozlov showed that the existence of a complete source in a directed graph provides a shelling of its complex of directed trees. We will show that this…
We give a purely algebraic construction of the continuous closure of any finitely generated torsion free module; a concept first studied by H.~Brenner and M.~Hochster. The construction implies that, at least in characteristic 0, taking…
We prove new cases of Vojta's conjectures for surfaces in the context of function fields, with truncation equal to one and providing an effective explicit description of the exceptional set. We also prove a general and explicit result…
The ultrafilters on the partial order $([\omega]^{\omega},\subseteq^*)$ are the free ultrafilters on $\omega$, which constitute the space $\omega^*$, the Stone-Cech remainder of $\omega$. If $U$ is an upperset of this partial order (i.e., a…
For integer $k\geq2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilton cycles, J. Graph Theory 29 (1998) 227--237], we provide…
The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah. The corresponding completely proper forcing which…
We show the theory of pointed $\R$-trees with radius at most $r$ is axiomatizable in a suitable continuous signature. We identify the model companion $\rbRT_r$ of this theory and study its properties. In particular, the model companion is…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…