English
Related papers

Related papers: Some combinatorial properties of splitting trees

200 papers

We investigate some versions of amoeba for tree-forcings in the generalized Cantor and Baire spaces. This answers [10, Question 3.20] and generalizes a line of research that in the standard case has been studied in [11], [13], and [7].…

Logic · Mathematics 2020-08-13 Giorgio Laguzzi

We investigate the consistency strength of the statement: $\kappa$ is weakly compact and there is no tree on $\kappa$ with exactly $\kappa^{+}$ many branches. We show that this statement fails strongly (in the sense that there is a sealed…

Logic · Mathematics 2021-09-22 Yair Hayut , Sandra Müller

We investigate the unbalanced ordinary partition relations of the form $\lambda \rightarrow {(\lambda, \alpha)}^{2}$ for various values of the cardinal $\lambda$ and the ordinal $\alpha$. For example, we show that for every infinite…

Logic · Mathematics 2016-02-26 Dilip Raghavan , Stevo Todorcevic

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

Operator Algebras · Mathematics 2009-01-26 Mihai Popa

We prove that successors of singular limits of strongly compact cardinals have the strong tree property. We also prove that aleph_{omega+1} can consistently satisfy the strong tree property.

Logic · Mathematics 2013-01-28 Laura Fontanella

We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…

Logic · Mathematics 2024-04-18 Martin Goldstern , Jakob Kellner , Diego A. Mejía , Saharon Shelah

We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…

Probability · Mathematics 2026-03-24 Cecilia Holmgren , Jasper Ischebeck , Svante Janson

We show that higher Sacks forcing at a regular limit cardinal and club Miller forcing at an uncountable regular cardinal both add a diamond sequence. We answer the longstanding question, whether $\kappa = \kappa^{<\kappa} \geq\aleph_1$…

Logic · Mathematics 2025-04-14 Heike Mildenberger , Saharon Shelah

Motivated by two open questions about two-cardinal tree properties, we introduce and study generalized narrow system properties. The first of these questions asks whether the strong tree property at a regular cardinal $\kappa \geq \omega_2$…

Logic · Mathematics 2023-04-06 Chris Lambie-Hanson

We show that it is consistent, relative to $\omega$ many supercompact cardinals, that the super tree property holds at $\aleph_n$ for all $2 \leq n < \omega$ but there are weak square and a very good scale at $\aleph_{\omega}$.

Logic · Mathematics 2016-11-08 Yair Hayut , Spencer Unger

Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…

Logic · Mathematics 2023-03-03 Chris Lambie-Hanson , Šárka Stejskalová

Suppose that there's no transitive model of ZFC + there's a strong cardinal, and let K denote the core model. It is shown that if \delta has the tree property then \delta^{+K} = \delta^+ and \delta is weakly compact in K.

Logic · Mathematics 2016-09-07 Ralf Schindler

We study the effectiveness of subagging, or subsample aggregating, on regression trees, a popular non-parametric method in machine learning. First, we give sufficient conditions for pointwise consistency of trees. We formalize that (i) the…

Machine Learning · Statistics 2024-04-03 Christos Revelas , Otilia Boldea , Bas J. M. Werker

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

Logic · Mathematics 2011-10-18 Jakob Kellner , Saharon Shelah

In this paper, we answer a question asked in "A minimal Prikry type forcing for singularizing a measurable cardinal" regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For…

Logic · Mathematics 2021-05-26 Tom Benhamou

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…

General Topology · Mathematics 2014-05-26 Rodrigo R. Dias , Franklin D. Tall

We investigate the generalized tree properties and guessing model properties introduced by Wei\ss\ and Viale, as well as natural weakenings thereof, studying the relationships among these properties and between these properties and other…

Logic · Mathematics 2023-12-12 Chris Lambie-Hanson , Šárka Stejskalová

The Halpern-L\"auchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial essence of this proof, we isolate various partition principles…

Logic · Mathematics 2022-09-13 Chris Lambie-Hanson , Andy Zucker

Towards combining "compactness" and "hugeness" properties at $\omega_2$, we investigate the relevance of side-conditions forcing. We reduce the upper bound on the consistency strength of the weak Chang's Conjecture at $\omega_2$ using…

Logic · Mathematics 2022-10-24 Monroe Eskew