English
Related papers

Related papers: The power of trees

200 papers

Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of…

Logic · Mathematics 2023-01-10 Corey Bacal Switzer

Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$…

Logic · Mathematics 2021-10-08 Maxwell Levine , Heike Mildenberger

We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…

Logic · Mathematics 2007-05-23 Alex Hellsten , Tapani Hyttinen , Saharon Shelah

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

Logic · Mathematics 2022-03-14 Rahman Mohammadpour

Trees without vertices of degree $2$ are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves. The inducibility of a topological tree $S$…

Combinatorics · Mathematics 2018-02-20 Audace Amen Vioutou Dossou-Olory , Stephan Wagner

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

Given any infinite tree in the plane satisfying certain topological conditions, we construct an entire function $f$ with only two critical values $\pm 1$ and no asymptotic values such that $f^{-1}([-1,1])$ is ambiently homeomorphic to the…

Complex Variables · Mathematics 2021-10-04 Weiwei Cui

We show that for any regular cardinal $\kappa$, $\square_{\kappa, 2}$ is consistent with "all $\kappa^+$-Aronszajn trees are special." By a result of Shelah and Stanley this is optimal in the sense that $\square_{\kappa, 2}$ may not be…

Logic · Mathematics 2019-04-01 John Susice

This paper continues a line of investigation of the Halpern--L\"{a}uchli Theorem at uncountable cardinals. We prove in ZFC that the Halpern--L\"{a}uchli Theorem for one tree of height $\kappa$ holds whenever $\kappa$ is strongly…

Logic · Mathematics 2023-01-03 Natasha Dobrinen , Saharon Shelah

From a suitable large cardinal hypothesis, we provide a model with a supercompact cardinal in which universal indestructibility holds: every supercompact and partially supercompact cardinal kappa is fully indestructible by kappa-directed…

Logic · Mathematics 2007-05-23 Arthur W. Apter , Joel David Hamkins

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

Bonato and Tardif conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or infinite. We prove the analogue of their conjecture for rooted trees. We also discuss the original…

Combinatorics · Mathematics 2011-02-24 Mykhaylo Tyomkyn

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

Logic · Mathematics 2008-02-03 Saharon Shelah

Denote by $p_m$ the $m$-th prime number ($p_1=2,~p_2=3,~p_3=5,~ p_4=7,~\ldots$). Let $T$ be a rooted tree with branches $T_1,T_2,\ldots,T_r$. The Matula number $M(T)$ of $T$ is $p_{M(T_1)}\cdot p_{M(T_2)}\cdot \ldots \cdot p_{M(T_r)}$,…

Combinatorics · Mathematics 2020-04-07 Audace Amen Vioutou Dossou-Olory

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

Combinatorics · Mathematics 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

It is known that all but finitely many leaves of a measured foliated 2-complex of thin type are quasi-isometric to an infinite tree with at most two topological ends. We show that if the foliation is cooriented, and the associated R-tree is…

Geometric Topology · Mathematics 2015-09-01 Ivan Dynnikov , Alexandra Skripchenko

The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift $X$ and its associated hom tree-shift $\mathcal{T}_{X}$, as well as the equivalence in the sofic shift. On the…

Dynamical Systems · Mathematics 2021-08-31 Jung-Chao Ban , Chih-Hung Chang , Wen-Guei Hu , Guan-Yu Lai , Yu-Liang Wu

We show that from a supercompact cardinal \kappa, there is a forcing extension V[G] that has a symmetric inner model N in which ZF + not AC holds, \kappa\ and \kappa^+ are both singular, and the continuum function at \kappa\ can be…

Logic · Mathematics 2016-02-10 Arthur W. Apter , Brent Cody

We study extremal properties of finite ultrametric spaces $X$ and related properties of representing trees $T_X$. The notion of weak similarity for such spaces is introduced and related morphisms of labeled rooted trees are found. It is…

Metric Geometry · Mathematics 2017-12-19 O. Dovgoshey , E. Petrov , H. -M. Teichert

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Computational Complexity · Computer Science 2026-01-01 Alice Moayyedi