English
Related papers

Related papers: A Rigid Kurepa Tree From a Free Suslin Tree

200 papers

We introduce and study a new topology on trees, that we call the countably coarse wedge topology. Such a topology is strictly finer than the coarse wedge topology and it turns every chain complete, rooted tree into a Fr\'echet--Urysohn,…

General Topology · Mathematics 2022-03-16 Tommaso Russo , Jacopo Somaglia

Let $T^*$ be an almost Suslin tree, that is, an Aronszajn tree with no stationary antichains. Krueger introduced a forcing axiom, $\mathrm{PFA}(T^*)$, for the class of proper forcings that preserve that $T^*$ is almost Suslin. He showed…

Logic · Mathematics 2025-11-05 Carlos Martínez-Ranero , Lucas Polymeris

We construct the COpula Recursive Tree (CORT) estimator: a flexible, consistent, piecewise linear estimator of a copula, leveraging the patchwork copula formalization and various piecewise constant density estimators. While the patchwork…

Statistics Theory · Mathematics 2024-02-27 Oskar Laverny , Esterina Masiello , Véronique Maume-Deschamps , Didier Rullière

We investigate various strong notions of rigidity for Souslin trees, separating them under Diamond into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under Diamond that there is a group whose…

Logic · Mathematics 2016-08-16 Joel David Hamkins , Gunter Fuchs

To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…

Group Theory · Mathematics 2024-05-29 Jean Pierre Mutanguha

We construct a model in which all $C$-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question of Lambie-Hanson and Rinot, and provides an optimal combination of compactness and…

Logic · Mathematics 2025-04-10 Assaf Rinot , Zhixing You , Jiachen Yuan

Assuming the existence of a strong cardinal $\kappa$, a weakly compact cardinal $\lambda$ above it and $\gamma > \lambda,$ we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any given cofinality $\delta$,…

Logic · Mathematics 2020-06-26 Mohammad Golshani , Alejandro Poveda

A wide Aronszajn tree is a tree of size and height $\omega_1$ with no uncountable branches. We prove that under $MA(\omega_1)$ there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler…

Logic · Mathematics 2023-06-22 Mirna Džamonja , Saharon Shelah

A $\kappa$-tree is said to be full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full $\kappa$-Souslin tree may consistently exist. Shelah gave an affirmative answer of height a strong limit…

Logic · Mathematics 2024-03-01 Assaf Rinot , Shira Yadai , Zhixing You

Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…

Number Theory · Mathematics 2025-08-22 Trey Smith , Aksel Ozer

We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…

Data Structures and Algorithms · Computer Science 2022-01-03 Liang Li , Guangzeng Xie

A wide Aronszajn tree is a tree of size $\aleph_1$ with no uncountable branches. Assuming the consistency of the existence of a weakly compact cardinal, we show the consistency of the existence of a wide Aronszajn tree that is…

Logic · Mathematics 2025-11-11 Siiri Kivimäki

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.

Logic · Mathematics 2009-09-25 Menachem Magidor , Saharon Shelah

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

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

Logic · Mathematics 2013-09-03 Heike Mildenberger , Saharon Shelah

We show that there are proper forcings based upon countable trees of creatures that specialize a given Aronszajn tree.

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

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á

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

Discrete Mathematics · Computer Science 2016-02-02 Fabrizio Luccio

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 questions involving Aronszajn trees, square principles, and stationary reflection. We first consider two strengthenings of $\square(\kappa)$ introduced by Brodsky and Rinot for the purpose of constructing $\kappa$-Souslin…

Logic · Mathematics 2016-06-07 Chris Lambie-Hanson